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
The phase transition in 1-in-k SAT and NAE 3-SAT
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Rigorous results for random (2 + p)-SAT
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
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Small maximal matchings in random graphs
Theoretical Computer Science - Latin American theoretical informatics
The threshold for random k-SAT is 2k (ln 2 - O(k))
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
On the average similarity degree between solutions of random k-SAT and random CSPs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
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
Resolution complexity of random constraint satisfaction problems: another half of the story
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
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
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing
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
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
Theoretical Computer Science
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science
Hiding satisfying assignments: two are better than one
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Hiding satisfying assignments: two are better than one
Journal of Artificial Intelligence Research
An analysis of phase transition in NK landscapes
Journal of Artificial Intelligence Research
Resolution complexity of random constraint satisfaction problems: Another half of the story
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
IEEE Transactions on Information Theory
Discrete Applied Mathematics
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
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
Survey: The cook-book approach to the differential equation method
Computer Science Review
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 |