Publications

Found 2 results
Author Title [ Type(Desc)] Year
Filters: Author is Toniann Pitassi  [Clear All Filters]
Conference Paper
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.