A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
Fast algorithms with preprocessing for matrix-vector multiplication problems
Journal of Complexity
Computing associative functions distributively in spite of link failures
Journal of Parallel and Distributed Computing
The complexity of logic-based abduction
Journal of the ACM (JACM)
The minimum broadcast time problem for several processor networks
Theoretical Computer Science
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
On the structure of parameterized problems in NP
Information and Computation
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
On compact representations of propositional circumscription
Theoretical Computer Science
Constraint tightness and looseness versus local and global consistency
Journal of the ACM (JACM)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Randomized query processing in robot path planning
Journal of Computer and System Sciences
Efficient searching with linear constraints
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems
IEEE Transactions on Computers
Using Compiled Knowledge to Guide and Focus Abductive Diagnosis
IEEE Transactions on Knowledge and Data Engineering
The Complexity of Iterated Belief Revision
ICDT '97 Proceedings of the 6th International Conference on Database Theory
PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Preprocessing of intractable problems
Information and Computation
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A survey on knowledge compilation
AI Communications
A formal framework for speedup learning from problems and solutions
Journal of Artificial Intelligence Research
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Parameterized Complexity
The size of MDP factored policies
Eighteenth national conference on Artificial intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Invitation to data reduction and problem kernelization
ACM SIGACT News
Model Checking and Preprocessing
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
On polynomial sized MDP succinct policies
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
The idea of preprocessing part of the input of a problem in order to improve efficiency has been employed by several researchers in several areas of computer science. In this article, we show sufficient conditions to prove that an intractable problem cannot be efficiently solved even allowing an exponentially long preprocessing phase. The generality of such conditions is shown by applying them to various problems coming from different fields. While the results may seem to discourage the use of compilation, we present some evidence that such negative results are useful in practice.