Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Shortest Single Axioms for the Equivalential Calculus with CD and RCD
Journal of Automated Reasoning
On the maximum satisfiability of random formulas
Journal of the ACM (JACM)
Hi-index | 0.00 |