Publications

Found 1 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Title is C and Author is Toniann Pitassi  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
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.