On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete 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
Fingerprinting intellectual property using constraint-addition
Proceedings of the 37th Annual Design Automation Conference
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
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
Some Notes on Random Satisfiability
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
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
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
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
Phase transition in a random NK landscape model
Artificial Intelligence
Hiding satisfying assignments: two are better than one
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generating hard satisfiable formulas by hiding solutions deceptiveily
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Hiding satisfying assignments: two are better than one
Journal of Artificial Intelligence Research
Generating hard satisfiable formulas by hiding solutions deceptively
Journal of Artificial Intelligence Research
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
Approximation algorithm for random MAX-kSAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A generating function method for the average-case analysis of DPLL
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
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
An analysis of one-dimensional schelling segregation
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
Integer feasibility of random polytopes: random integer programs
Proceedings of the 5th conference on Innovations in theoretical computer science
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.00 |