Tutorial on computational complexity

Interfaces

Volumn 32, Issue 3, 2002, Pages 30-61

  Tovey, Craig A ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Analysis of algorithms; Computational complexity

Indexed keywords

EID: 0036558763     PISSN: 00922102     EISSN: None     Source Type: Journal    
DOI: 10.1287/inte.32.3.30.39     Document Type: Article

References (27)

1. Recognizing equilibria in spatial voting games
2. A location based heuristic for general routing problems
3. Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems
4. New lower bound techniques for robot motion planning problems
5. When is the classroom assignment problem hard?
6. New results on the old k-opt algorithm for the traveling salesman problem
7. Edmonds polytopes and a hierarchy of combinatorial problems
8. The P-matrix problem is co-NP-complete
9. An introduction to structured modeling
10. Structured modeling
11. Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming
12. A general framework for modeling production
13. Some optimal inapproximability results
14. A 7/8 approximation algorithm for MAX 3SAT
15. A simplified NP-complete satisfiability problem