Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms
A general upper bound for the satisfiability threshold of random r-SAT formulae
Journal of Algorithms
Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
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
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
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
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
On the critical exponents of random k-SAT
Random Structures & Algorithms
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
Random 3-SAT: The Plot Thickens
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Random 3-SAT and BDDs: The Plot Thickens Further
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The threshold for random k-SAT is 2k (ln 2 - O(k))
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Space complexity of random formulae in resolution
Random Structures & Algorithms
Random 3-SAT: The Plot Thickens
Constraints
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Approximating the Satisfiability Threshold for Random k-XOR-formulas
Combinatorics, Probability and Computing
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
Linear phase transition in random linear constraint satisfaction problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
Phase transition in a random NK landscape model
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A new look at survey propagation and its generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
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
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
The unsatisfiability threshold revisited
Discrete Applied Mathematics
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
Phase transition in a random NK landscape model
Artificial Intelligence
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
On Random Ordering Constraints
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Generation of hard non-clausal random satisfiability problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Phase transition for random quantified XOR-formulas
Journal of Artificial Intelligence Research
Phase transitions of bounded satisfiability problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A model for generating random quantified boolean formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
On random betweenness constraints
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
IEEE Transactions on Information Theory
On random betweenness constraints
Combinatorics, Probability and Computing
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
A Better Algorithm for Random $k$-SAT
SIAM Journal on Computing
Discrete Applied Mathematics
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
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
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Sensitivity of Boolean formulas
European Journal of Combinatorics
| Hi-index | 0.06 |