Abstract

Abstract. We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more. 1

Citations

697	Fellows M: Parameterized Complexity - Downey - 1999
505	Optimization, approximation, and complexity classes - Papadimitriou, Yannakakis - 1988
141	Vertex cover: Further observations and further improvements - Chen, Kanj, et al.
125	On the solution of traveling salesman problems - Applegate, Bixby, et al. - 1998
94	A dynamic programming approach to sequencing problems - Held, Karp - 1962
90	On selecting a satisfying truth assignment - Papadimitriou - 1991
84	Algorithms for maximum independent sets - Robson - 1986
83	L: On cliques in graphs - Moon, Moser - 1965
79	H.: The quadratic assignment problem: A survey and recent developments - Pardalos, Rendl, et al. - 1994
78	Which problems have strongly exponential complexity - Impagliazzo, Paturi, et al.
63	Finding a maximum independent set - Tarjan, Trojanowski - 1977
58	Solving satisfiability in less than 2 n steps - Monien, Speckenmeyer - 1985
58	F.: Satisfiability coding lemma - Paturi, Pudlák, et al. - 1999
53	S.Sahni, Computing partitions with applications to the Knapsack problem - Horowitz - 1974
46	A note on the complexity of the chromatic number problem - Lawler - 1976
37	Finding maximum independent sets in sparse and general graphs - Beigel - 1999
35	3-coloring in time O(1.3446 n ): a no-MIS algorithm - Beigel, Eppstein - 1995
35	Improved algorithms for 3-coloring, 3edge-coloring, and constraint satisfaction,” Symposium on Discrete Algorithms - Eppstein - 2001
34	Fixed-parameter tractability and completeness IV: on completeness for - Abrahamson, Downey, et al. - 1995
34	1979]: Computers and intractability. A guide to the Theory of NP-Completeness. W.H. Freeman and - Garey, Johnson
31	Small maximal independent sets and faster exact graph coloring - Eppstein
30	A probabilistic 3-SAT algorithm further improved - Hofmeister, Schöning, et al. - 2002
25	An O(2 0.304n ) algorithm for solving maximum independent set problem - Jian - 1986
25	Minimizing the number of states in incompletely specified state machines - Paull, Unger - 1959
21	Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms - Kullmann - 1996
18	On the Complexity of k-SAT - Impagliazzo, Paturi - 2001
15	On limited versus polynomial nondeterminism - Feige, Kilian - 1997
14	The Searching over Separators Strategy To Solve Some NP-Hard - Hwang, Chang, et al. - 1993
11	Satisfiability – algorithms and logic - Pudlak - 1998
9	Fixed parameter intractability - Downey, Fellows - 1992
7	Faster exact solutions for some NP-hard problems - Drori, Peleg
7	What are the least tractable instances of max. independent set - Johnson, Szegedy - 1999
4	Algorithms for quantified boolean formulas - Williams - 2002
2	Exponential time algorithms for computing the bandwidth of a graph - Feige, Kilian
2	1998]. An improved exponential time algorithm for k-SAT - Paturi, Pudlak, et al.
2	A new approach on solving 3-satisfiability - Rodoˇsek - 1996
1	Schöning [2001]. A deterministic (2− 2 k+1 )n algorithm for k-SAT based on local search - Dantsin, Goerdt, et al.
1	2000]. Faster exact solutions for - Gramm, Niedermeier
1	1999]. New methods for 3-SAT decision and worst case analysis - Kullmann
1	Tarjan [1979]. A separator theorem for planar graphs - Lipton, E
1	1992]. Solving 3-satisfiability in less than O(1.579 n ) steps. Selected papers from - Schiermeyer
1	Deciding 3-colorability in less than O(1.415 n ) steps - Schiermeyer
1	Schöning [1999]. A probabilistic algorithm for k-SAT and constraint satisfaction problems - unknown authors
1	Schöning [2001]. New algorithms for k-SAT based on the local search principle - unknown authors