An algorithm for the satisfiability problem of formulas in conjunctive normal form

Journal of Algorithms

Volumn 54, Issue 1, 2005, Pages 40-44

  Schuler, Rainer ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

CNF SAT; Complexity theory; Np completeness; Probabilistic algorithms

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

CNF-SAT; COMPLEXITY THEORY; PROBABILISTIC ALGORITHMS;

ALGORITHMS;

EID: 10644294639     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.04.012     Document Type: Article

References (7)

1. V. Arvind, R. Schuler, The quantum query complexity of 0-1 knapsack and associated claw problems, in: Proceedings of the 14th Annual International Symposium on Algorithms and Computation, in: Lecture Notes in Comput. Sci., Springer-Verlag, 2003, in press.
2. E.A. Hirsch, New worst-case upper bounds for sat, 2nd Special Issue on SAT, J. Automat. Reason. 24 (4) (2000) 397-420.
3. R. Impagliazzo, R. Paturi, Complexity of k-SAT, in: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, 1990, pp. 237-240.
4. P. Pudlák, R. Impagliazzo, A lower bound for dll algorithms for k-SAT (preliminary version), in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, 2000, pp. 128-136.
5. R. Paturi, P. Pudlák, F. Zane, Satisfiability coding lemma, in: 38th Ann. IEEE Sympos. on Foundations of Comp. Sci., FOCS'97, 1997, pp. 566-574.
6. P. Pudlák, Satisfiability - algorithms and logic, in: Proceedings of the 23rd Mathematical Foundations of Computer Science, vol. 1450, Springer-Verlag, 1998, pp. 129-141.
7. J.M. Robson, Algorithms for maximum independent sets, J. Algorithms 7 (1986) 425-440.