On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The phase transition in random Horn satisfiability and its algorithmic implications
Proceedings of the tenth 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
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Statistical mechanics methods and phase transitions in optimizationproblems
Theoretical Computer Science - Phase transitions in combinatorial problems
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
A note on random 2-SAT with prescribed literal degrees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Random MAX SAT, random MAX CUT, and their phase transitions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Linear phase transition in random linear constraint satisfaction problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
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
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Combinatorics, Probability and Computing
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
Resolution complexity of random constraint satisfaction problems: another half of the story
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
Phase transitions of PP-complete satisfiability problems
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
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Theoretical Computer Science
(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Phase transitions of bounded satisfiability problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Resolution complexity of random constraint satisfaction problems: Another half of the story
Discrete Applied Mathematics
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
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
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
Random 2-XORSAT at the satisfiability threshold
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Delaying satisfiability for random 2SAT
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Satisfiability threshold of the skewed random k-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Limit theorems for random MAX-2-XORSAT
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Survey: The cook-book approach to the differential equation method
Computer Science Review
Exponential lower bounds for DPLL algorithms on satisfiable random 3-CNF formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
Hi-index | 0.01 |