Algorithmics in exponential time

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 36-43

  Schöning, Uwe ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

BACKTRACKING ALGORITHMS; EXPONENTIAL ALGORITHMS; EXPONENTIAL TIME;

COMPUTATIONAL COMPLEXITY;

EID: 24144439265     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_3     Document Type: Conference Paper

References (19)

1. B. Aspvall, M.F. Plass, and R.E. Tarjan: A linear time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters 8(3) (1979) 121-123.
2. R.B. Ash: Information Theory. Dover 1965.
3. S. Baumer and R. Schuler: Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs, In Theory and Applications of Satisfiability Testing, SAT 2003, Lecture Notes in Computer Science, Vol. 2919, 150-161, 2004.
4. R. Beigel and D. Eppstein: 3-coloring in time O(1:3446 n): a no-MIS algorithm. In Proceedings of the 36nd Annual IEEE Symposium on Foundations of Computer Science, IEEE 1995, pages 444-452.
5. T. Brueggemann and W. Kern: An improved local search algorithm for 3-SAT. Memorandum No. 1709, Department of Applied Mathematics, University of Twente, 2004.
6. G. Cohen, I. Honkala, and S. Litsyn, A. Lobstein: Covering Codes. North-Holland 1997.
7. E. Dantsin, A. Goerdt, E.A. Hirsch, and U. Schöming: Deterministic algorithms for k-SAT based on covering codes and local search. Proc. 27th International Colloquium on Automata, Languages and Programming 2000. Springer Lecture Notes in Computer Science, Vol. 1853, pages 236-247, 2000.
8. n algorithm for k-SAT based on local search. To appear in Theoretical Computer Science.
9. T. Hofmeister, U. Schöning, and R. Schuler, O. Watanabe: A probabilistic 3-SAT algorithm further improved. In Proc. of the 19th Sympos. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 2285, 193-202, 2002.
10. K. Iwama and S. Tamaki: Improved upper bounds for 3-SAT. Electronic Colloquium on Computational Complexity. Report No. 53, 2003.
11. Also: Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete algorithms, ACM, 2004, pp. 328-328.
12. n steps. Discrete Applied Mathematics 10 (1985) 287-295.
13. C.H. Papadimitriou: On selecting a satisfying truth assignment. Proceedings of the 32nd Ann. IEEE Symp. on Foundations of Computer Science, pp. 163-169, 1991.
14. R. Paturi, P. Pudlák, and F. Zane: Satisfiability coding lemma. Proceedings 38th IEEE Symposium on Foundations of Computer Science 1997, 566-574.
15. R. Paturi, P. Pudlák, M.E. Saks, and F. Zane: An improved exponential-time algorithm for k-SAT. Proceedings 39th IEEE Symposium on Foundations of Computer Science 1998, pp. 628-637.
16. M. Saks and A. Wigderson: Probabilistic boolean decision trees and the complexity of evaluating game trees. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science. IEEE Computer Science Press, 1986, pp. 29-38.
17. U. Schöning: On The Complexity of Constraint Satisfaction Problems. Ulmer Informatik-Berichte, Nr. 99-03. Universität Ulm, Fakultät für Informatik, 1999.
18. U. Schöning: A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proceedings 40th IEEE Symposium on Foundations of Computer Science 1999, 410-414.
19. U. Schöning: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32, 4 (2002) 615-623.