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
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th 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
Reformulating Propositional Satisfiability as Constraint Satisfaction
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
AVAL: An Enumerative Method for SAT
CL '00 Proceedings of the First International Conference on Computational Logic
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
On an online random k-SAT model
Random Structures & Algorithms
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
(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
A Better Algorithm for Random k-SAT
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
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
Proceedings of the forty-second ACM symposium on Theory of computing
IEEE Transactions on Information Theory
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
A Better Algorithm for Random $k$-SAT
SIAM Journal on Computing
Quantum Information & Computation
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Information Processing Letters
Satisfiability threshold of the skewed random k-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
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
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
The power of semidefinite programming relaxations for MAX-SAT
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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
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
Journal of the ACM (JACM)
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
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.06 |
Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is fixed at any value greater than 1, but n tends to infinity and m = (1 + o(1))cn for some c depending only on k. It is easy to see that F is unsatisfiable with probability 1-o(1) whenever c(ln 2)2/sup k/; the authors complement this observation by proving that F is satisfiable with probability 1-o(1) whenever c1.