Study of algorithms which have been successful in real world. New algorithmic tools, ways to create approximation algorithms for NP-Hard problems, exploit the power of randomness, and create tractable abstract problems from messy real-world problems.
Prerequisite: 530 or 561
Geometric and Probabilistic Methods in Computer Science - CS 530
Algorithms/Data Structure - CS 561
MSC11 6325
1 University of New Mexico
Albuquerque, NM 87131
(505) 277-8900
Phone: (505) 277-6809
Fax: