On the complexity of unsatisfiability proofs for random k-CNF formulas

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 561-571

  Beame, Paul ^a   Karp, Richard ^a   Pitassi, Toniann ^a   Saks, Michael ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

DAVIS-PUTNAM ALGORITHM;

RANDOM PROCESSES;

EID: 0031639853     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276870     Document Type: Conference Paper

References (19)