A Parameterized Halting Problem (Q2908544): Difference between revisions

@@ Property / cites work @@
+Fixed Structure Complexity
@@ Property / cites work: Fixed Structure Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Strong isomorphism reductions in complexity theory
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of short computation and factorization
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Computation Models for Parameterized Complexity
@@ Property / cites work: Computation Models for Parameterized Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of Gödel's proof predicate
@@ Property / cites work: On the complexity of Gödel's proof predicate / rank @@
+Normal rank
@@ Property / cites work @@
+A Logic for PTIME and a Parameterized Halting Problem
+Normal rank
@@ Property / cites work @@
+On p-Optimal Proof Systems and Logics for PTIME
@@ Property / cites work: On p-Optimal Proof Systems and Logics for PTIME / rank @@
+Normal rank
@@ Property / cites work @@
+On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Q4281497
@@ Property / cites work: Q4281497 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability, Definability, and Model-Checking
+Normal rank
@@ Property / cites work @@
+Complexity classes of equivalence problems revisited
+Normal rank
@@ Property / cites work @@
+Complexity classes without machines: on complete languages for UP
+Normal rank
@@ Property / cites work @@
+Relational queries computable in polynomial time
@@ Property / cites work: Relational queries computable in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258579
@@ Property / cites work: Q4258579 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal proof systems imply complete sets for promise classes
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+Q4381398
@@ Property / cites work: Q4381398 / rank @@
+Normal rank
@@ Property / cites work @@
+Speedup for natural problems and noncomputability
@@ Property / cites work: Speedup for natural problems and noncomputability / rank @@
+Normal rank
@@ Property / cites work @@
+On an optimal propositional proof system and the structure of easy subsets of TAUT.
+Normal rank
@@ Property / cites work @@
+On Computable Numbers, with an Application to the Entscheidungsproblem
+Normal rank