On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Random 2-SAT: results and problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
Reformulating Propositional Satisfiability as Constraint Satisfaction
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
AVAL: An Enumerative Method for SAT
CL '00 Proceedings of the First International Conference on Computational Logic
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
Eighteenth national conference on Artificial intelligence
On the average similarity degree between solutions of random k-SAT and random CSPs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Linear phase transition in random linear constraint satisfaction problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Many hard examples in exact phase transitions
Theoretical Computer Science
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Proceedings of the forty-second ACM symposium on Theory of computing
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |