Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Many hard examples for resolution
Journal of the ACM (JACM)
The Maple handbook (Maple V release 3)
The Maple handbook (Maple V release 3)
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A threshold for unsatisfiability
Journal of Computer and System Sciences
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
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Computing rigorous bounds on the solution of an initial value problem for an ordinary differential equation
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
Results related to threshold phenomena research in satisfiability: lower bounds
Theoretical Computer Science - Phase transitions in combinatorial problems
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science - Phase transitions in combinatorial problems
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
Almost all graphs with average degree 4 are 3-colorable
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Some Notes on Random Satisfiability
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
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
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences - STOC 2002
On the average similarity degree between solutions of random k-SAT and random CSPs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
Phase transition in a random NK landscape model
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
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
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
Phase transition in a random NK landscape model
Artificial Intelligence
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
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
Survey: The cook-book approach to the differential equation method
Computer Science Review
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
Hi-index | 0.00 |