A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
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
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Scaling Properties of Pure Random Walk on Random 3-SAT
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
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
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
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
The unsatisfiability threshold revisited
Discrete Applied Mathematics
Phase transition in a random NK landscape model
Artificial Intelligence
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Survey: The cook-book approach to the differential equation method
Computer Science Review
Unsatisfiability bounds for random CSPs from an energetic interpolation method
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Pushing random walk beyond golden ratio
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.00 |
Let F/sub 3/(n,m) be a random 3-SAT formula formed by selecting uniformly, independently and with replacement, m clauses among all 8(/sup n/C/sub 3/) possible 3-clauses over n variables. It has been conjectured that there exists a constant r/sub 3/ such that, for any /spl epsiv/