Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Probabilistic performance of a heuristic for the satisfiability problem
Discrete Applied Mathematics
The first cycles in an evolving graph
Discrete Mathematics
Information Sciences: an International Journal
Counting the number of solutions for instances of satisfiability
Theoretical Computer Science
Probabilistic approach to the satisfiability problem
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Treshold for Unsatisfiability
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS
EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS
Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth 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
Random regular graphs with edge faults: expansion through cores
Theoretical Computer Science
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
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
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
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
Random Regular Graphs with Edge Faults: Expansion through Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Random 3-SAT: The Plot Thickens
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
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
Analysis of edge deletion processes on faulty random regular graphs
Theoretical Computer Science - Latin American theoretical informatics
Random 3-SAT: The Plot Thickens
Constraints
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
The pure literal rule threshold and cores in random hypergraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
On the maximum satisfiability of random formulas
Journal of the ACM (JACM)
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Stochastic search and phase transitions: AI meets physics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
On random betweenness constraints
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Experimental results on the crossover point in satisfiability problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
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
On random betweenness constraints
Combinatorics, Probability and Computing
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
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
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
Integer feasibility of random polytopes: random integer programs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |