On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
Random Constraint Satisfaction: Theory Meets Practice
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |