Arc and path consistence revisited
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Resolution proofs of generalized pigeonhole principles. (Note)
Theoretical Computer Science
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Constraint satisfaction algorithms
Computational Intelligence
From local to global consistency
Artificial Intelligence
Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results
Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The Logic of Constraint Satisfaction
The Logic of Constraint Satisfaction
The complexity of the pigeonhole principle
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Journal of Artificial Intelligence Research
A comparison of ATMS and CSP techniques
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
A general backtrack algorithm that eliminates most redundant tests
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Annals of Mathematics and Artificial Intelligence
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We prove exponential lower bounds on the running time of many algorithms for Constraint Satisfaction, by giving a simple family of instances on which they always take exponential time. Although similar lower bounds for most of these algorithms have been shown before, we provide a uniform treatment which illustrates a powerful general approach and has stronger implications for the practice of algorithm design.