Publications

Found 2 results
Author Title Type [ Year(Asc)]
Filters: Author is Toniann Pitassi  [Clear All Filters]
1998
Beame P, Karp RM, 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.