SPace and Time Complexity of Exact Algorithms: Some open problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 281-290

  Woeginger, Gerhard J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EXACT ALGORITHMS; EXPONENTIAL TIME; SPACE AND TIME COMPLEXITY; SPACE BOUNDS; WORST-CASE BEHAVIORS;

COMPUTATIONAL COMPLEXITY;

EID: 35048902384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_25     Document Type: Article

References (26)

1. E.T. BAX (1993). Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters 47, 203-207.
2. E.T. BAX (1994). Algorithms to count paths and cycles. Information Processing Letters 52, 249-252.
3. E.T. BAX AND J. FRANKLIN (1996). A finite-difference sieve to count paths and cycles by length. Information Processing Letters 60, 171-176.
4. M. BEN-OR (1983). Lower bounds for algebraic computation trees. In Proceedings of the 15th Annual ACM Symposium on the Theory of Computing (STOC'1983), 80-86.
5. D. COPPERSMITH AND S. WINOGRAD (1990). Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9, 251-280.
6. 2 on linear search programs for the knapsack problem. Journal of Computer and System Sciences 16, 413-417.
7. R.G. DOWNEY AND M.R. FELLOWS (1995). Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141, 109-131.
8. R.G. DOWNEY AND M.R. FELLOWS (1999). Parameterized complexity. Springer Monographs in Computer Science.
9. F. EISENBRAND AND F. GRANDONI (2004). On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science, to appear.
10. D. EPPSTEIN (2003). The traveling salesman problem for cubic graphs. In Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'2003), Springer-Verlag, LNCS 2748, 307-318.
11. J. ERICKSON (1999). Lower bounds for linear satisfiability problems. Chicago Journal of Theoretical Computer Science 1999(8).
12. J. ERICKSON (2004). Private communication.
13. |E|/4. (In Russian). Zapiski Nauchnykh Seminarov Sankt-Peterburgskoe Otdeleniya Matematicheskiǐ Institut imeni V.A. Steklova 293, 129-138.
14. U. FEIGE AND J. KILIAN (1997). On limited versus polynomial nondeterminism. Chicago Journal of Theoretical Computer Science 1997.
15. 2) problems in computational geometry. Computational Geometry 5, 165-185.
16. M.R. GAREY AND D.S. JOHNSON (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
17. M. HELD AND R.M. KARP (1962). A dynamic programming approach to sequencing problems. Journal of SIAM 10, 196-210.
18. E. HOROWITZ AND S. SAHNI (1974). Computing partitions with applications to the knapsack problem. Journal of the ACM 21, 277-292.
19. A. ITAI AND M. RODEH (1978). Finding a minimum circuit in a graph. SIAM Journal on Computing 7, 413-423.
20. R.M. KARP (1982). Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters 1, 49-51.
21. E.L. LAWLER (1976). A note on the complexity of the chromatic number problem. Information Processing Letters 5, 66-67.
22. J. NEŠETŘIL AND S. POLJAK (1985). On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26, 415-419.
23. n/4) algorithm for certain NP-complete problems. SIAM Journal on Computing 10, 456-464.
24. R.E. TARJAN AND A.E. TROJANOWSKI (1977). Finding a maximum independent set. SIAM Journal on Computing 6, 537-546.
25. R. WILLIAMS (2004). A new algorithm for optimal constraint satisfaction and its implications. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'2004), Springer Verlag, 2004.
26. G.J. WOEGINGER (2003). Exact algorithms for NP-hard problems: A survey. In Combinatorial Combinatorial Optimization - Eureka, you shrink!", LNCS 2570, Springer Verlag, 185-207.