On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-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
Elements of the Theory of Computation
Elements of the Theory of Computation
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
We consider a non-standard parametrization, where, forproblems consisting of a combinatorial structure and a number, we parameterizeby the combinatorial structure, rather than by the number.For example, in the Short-Nondeterministic-Halt problem, which is todetermine if a nondeterministic machine M accepts the empty string int steps, we parameterize by |M|, rather than t. We call such parametrizationfixed structure parametrization. Fixed structure parametrization notonly provides a new set of parameterized problems, but also results inproblems that do not seem to fall within the classical parameterizedcomplexity classes. In this paper we take the first steps in understandingthese problems. We define fixed structure analogues of various classicalproblems, including graph problems, and provide complexity, hardnessand equivalence results.