An algorithm for finding Hamilton paths and cycles in random graphs
Combinatorica - Theory of Computing
Many hard examples for resolution
Journal of the ACM (JACM)
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
Journal of the ACM (JACM)
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Efficiency of Resolution and Davis--Putnam Procedures
SIAM Journal on Computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Treshold for Unsatisfiability
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A probabilistic analysis of randomly generated binary constraint satisfaction problems
Theoretical Computer Science
The Resolution Complexity of Random Constraint Satisfaction Problems
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the average similarity degree between solutions of random k-SAT and random CSPs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Computing minimal doubly resolving sets of graphs
Computers and Operations Research
Empirical Study of Relational Learning Algorithms in the Phase Transition Framework
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
Exploiting inference rules to compute lower bounds for MAX-SAT solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computing the metric dimension of graphs by genetic algorithms
Computational Optimization and Applications
Note: On exponential time lower bound of Knapsack under backtracking
Theoretical Computer Science
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Information Processing Letters
A note on treewidth in random graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Finding maximum colorful subtrees in practice
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Challenging heuristics: evolving binary constraint satisfaction problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
Variable-Centered Consistency in Model RB
Minds and Machines
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
| Hi-index | 5.23 |
This paper analyzes the resolution complexity of two random constraint satisfaction problem (CSP) models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, it is proved that almost all instances of Model RB/RD have no tree-like resolution proofs of less than exponential size. Thus, we not only introduce new families of CSPs and CNF formulas hard to solve, which can be useful in the experimental evaluation of CSP and SAT algorithms, but also propose models with both many hard instances and exact phase transitions. Finally, conclusions are presented, as well as a detailed comparison of Model RB/RD with the Hamiltonian cycle problem and random 3-SAT, which, respectively, exhibit three different kinds of phase transition behavior in NP-complete problems.