On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
| Title | On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas |
| Publication Type | Conference Paper |
| Year of Publication | 1998 |
| Authors | Beame, P., Karp R. M., Pitassi T., & Saks M. |
| Published in | Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing |
| Page(s) | 561-571 |
| Other Numbers | 453 |
| Bibliographic Notes | Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. pp. 561-571. |
| Abbreviated Authors | P. Beame, R.M. Karp, T. Pitassi, and M. Saks |
| ICSI Research Group | Algorithms |
| ICSI Publication Type | Article in conference proceedings |