Publications

Found 1 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is C and Author is Michael Saks  [Clear All Filters]
1998
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.