Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
DISTANCE-SAT: complexity and algorithms
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
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 lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
Information and Computation
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hard examples for bounded depth frege
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence
Proving Unsatisfiability of CNFs Locally
Journal of Automated Reasoning
Complete on average Boolean satisfiability
Journal of Complexity
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
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,
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
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
Random 3-SAT: The Plot Thickens
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Random 3-SAT and BDDs: The Plot Thickens Further
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat
Selected Papers from the 5th European Conference on Artificial Evolution
Lower Bounds for Space in Resolution
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution
Information and Computation
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Random CNF's are Hard for the Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Space complexity of random formulae in resolution
Random Structures & Algorithms
Random 3-SAT: The Plot Thickens
Constraints
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
A combinatorial characterization of treelike resolution space
Information Processing Letters
Mutilated chessboard problem is exponentially hard for resolution
Theoretical Computer Science
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Exponential bounds for DPLL below the satisfiability threshold
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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 in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
Hard examples for the bounded depth Frege proof system
Computational Complexity
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Theoretical Computer Science
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Lower bounds for k-DNF resolution on random 3-CNFs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Annals of Mathematics and Artificial Intelligence
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
The resolution complexity of random graphk-colorability
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
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Many hard examples in exact phase transitions
Theoretical Computer Science
Regular Random k-SAT: Properties of Balanced Formulas
Journal of Automated Reasoning
Discrete Applied Mathematics
Foundations and Trends® in Theoretical Computer Science
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the relation among answer set solvers
Annals of Mathematics and Artificial Intelligence
Random SAT Instances à la Carte
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Refutation by randomised general resolution
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Hidden gold in random generation of SAT satisfiable instances
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A model for generating random quantified boolean formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Systematic versus stochastic constraint satisfaction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The resolution complexity of random graph k-colorability
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
ACM Transactions on Computation Theory (TOCT)
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Experimental results on the crossover point in satisfiability problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Parameterized complexity of DPLL search procedures
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Captain Jack: new variable selection heuristics in local search for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the relation between answer set and sat procedures (or, between cmodels and smodels)
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Width versus size in resolution proofs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Variable minimal unsatisfiability
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Resolution tunnels for improved SAT solver performance
SAT'05 Proceedings of the 8th 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
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
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
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
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
On the resolution complexity of graph non-isomorphism
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards an understanding of polynomial calculus: new separations and lower bounds
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |
For every choice of positive integers c and k such that k ≥ 3 and c2-k ≥ 0.7, there is a positive number &egr; such that, with probability tending to 1 as n tends to ∞, a randomly chosen family of cn clauses of size k over n variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least (1 + &egr;)n clauses.