Relational queries computable in polynomial time
Information and Control
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Journal of the ACM (JACM)
Fixed-Parameter Tractability, Definability, and Model-Checking
SIAM Journal on Computing
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
Proceedings of the Mathematical Foundations of Computer Science 1984
Optimal Proof Systems for Propositional Logic and Complete Sets
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Optimal proof systems imply complete sets for promise classes
Information and Computation
The turing way to parameterized complexity
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On p-optimal proof systems and logics for PTIME
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On slicewise monotone parameterized problems and optimal proof systems for TAUT
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Note: Speedup for natural problems and noncomputability
Theoretical Computer Science
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
ICDT'05 Proceedings of the 10th international conference on Database Theory
Parameterized Complexity
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
The parameterized problem $p\textsc{-Halt}$ takes as input a nondeterministic Turing machine $\mathbb{M}$ and a natural number n, the size of $\mathbb{M}$ being the parameter. It asks whether every accepting run of $\mathbb{M}$ on empty input tape takes more than n steps. This problem is in the class XPuni , the class "uniform XP," if there is an algorithm deciding it, which for fixed machine $\mathbb{M}$ runs in time polynomial in n. It turns out that various open problems of different areas of theoretical computer science are related or even equivalent to $p{\rm \textsc{-Halt}\in{XP}_{uni}}$. Thus this statement forms a bridge which allows to derive equivalences between statements of different areas (proof theory, complexity theory, descriptive complexity, …) which at first glance seem to be unrelated. As our presentation shows, various of these equivalences may be obtained by the same method.