Found 3 results
Author Title Type [ Year(Asc)]
Filters: Author is Michael Saks  [Clear All Filters]
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.
Karp RM, Saks M, Wigderson A.  1986.  On a Search Problem Related to Branch-and-Bound Procedures. Proceedings of the 27th Annual Symposium on Foundations of Computer Science. :19-28.