Complexity of finding short resolution proofs

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

Volumn 1295, Issue , 1997, Pages 309-318

  Iwama, Kazuo ^a,b  

^a KYUSHU UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

CNF FORMULAS; NP-HARD; POLYNOMIAL-TIME; RESOLUTION PROOFS; SATISFIABILITY;

POLYNOMIAL APPROXIMATION;

EID: 84947731247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029974     Document Type: Conference Paper

References (10)

1. n): a no-MIS algorithm. Proc. 36th IEEE Symp. on Foundations of Computer Science, pages 444-452, 1995.
2. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996.
3. M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Groebner basis algorithm to find proofs of unsatisfiability. Proc. 28th A CM Symposium on Theory of Computing, pages 174-183, 1996.
4. O. Dubois. Counting the number of solutions for instances of satisfiability. Theor. Comput. Sci., 81:49-64, 1991.
5. A. Haken. The intractability of resolution. Theor. Compout. Sci., pages 297-308, 1985.
6. K. Iwama and E. Miyano. Intractability of read-once resolution. In Proe. lOth IEEE Structure in Complexity Conference, 1995.
7. 0.304n) algorithm for solving maximum independent set problem. IEEE Trans. Comput., C-35:847-851, 1986.
8. n steps. Discrete Appl. Math., 10:287-295, 1985.
9. J. Robson. Algorithms for maximum independent sets. J. Algr., 7:425-440, 1986.
10. n steps. 6th Worksh. Computer Science Logic, pages 379-394, 1993.