Publications
Found 3 results
[ Author] Title Type Year Filters: First Letter Of Last Name is B and Author is Paul Beame [Clear All Filters]
The Efficiency of Resolution and Davis-Putnamn Procedures.
31(4), 1048-1075.
(2002). 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).
(1989).