Publication Details
Title: On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
Author: P. Beame, R.M. Karp, T. Pitassi, and M. Saks
Group: Algorithms
Date: May 1998
PDF: [Not available online]
Bibliographic Information:
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71.
Bibliographic Reference:
P. Beame, R.M. Karp, T. Pitassi, and M. Saks. On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71., May 1998
Author: P. Beame, R.M. Karp, T. Pitassi, and M. Saks
Group: Algorithms
Date: May 1998
PDF: [Not available online]
Bibliographic Information:
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71.
Bibliographic Reference:
P. Beame, R.M. Karp, T. Pitassi, and M. Saks. On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71., May 1998