Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fixed-Parameter Tractability, Definability, and Model-Checking
SIAM Journal on Computing
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Parameterized Complexity
On parameterized complexity of the Multi-MCS problem
Theoretical Computer Science
Parameterized bounded-depth Frege is not optimal
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
The linear arrangement problem parameterized above guaranteed value
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterized Bounded-Depth Frege Is not Optimal
ACM Transactions on Computation Theory (TOCT)
On the space complexity of parameterized problems
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
Parameterized complexity of optimal planning: a detailed map
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial time is the class of all fixed-parameter tractable problems. We develop a basic complexity theory for the parameterized analogues of classical complexity classes and give, among other things, complete problems and logical descriptions. We then show that most of the well-known intractable parameterized complexity classes are not analogues of classical classes. Nevertheless, for all these classes we can provide natural logical descriptions.