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
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Rigorous results for random (2 + p)-SAT
Theoretical Computer Science - Phase transitions in combinatorial problems
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
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
AVAL: An Enumerative Method for SAT
CL '00 Proceedings of the First International Conference on Computational Logic
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
An effective heuristic algorithm for the maximum satisfiability problem
Applied Intelligence
On the solution-space geometry of random constraint satisfaction problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Regular Random k-SAT: Properties of Balanced Formulas
Journal of Automated Reasoning
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
The unsatisfiability threshold revisited
Discrete Applied Mathematics
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
Theoretical Computer Science
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
Circuit based encoding of CNF formula
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
New results on the phase transition for random quantified Boolean formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
IEEE Transactions on Information Theory
Discrete Applied Mathematics
Non uniform selection of solutions for upper bounding the 3-SAT threshold
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sensitivity of Boolean formulas
European Journal of Combinatorics
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.06 |