Publications
Found 1 results
[ Author] Title Type Year Filters: Author is Paul Beame and First Letter Of Title is C [Clear All Filters]
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas.
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
(1998).