The following pages link to Nondeterminism within $P^ * $ (Q4202212):
Displaying 31 items.
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Nondeterminism through well-founded choice (Q3128614) (← links)
- (Q3316559) (← links)
- Towards separating nondeterminism from determinism (Q3334987) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q3782784) (← links)
- Complexity classes with complete problems between P and NP-C (Q3974851) (← links)
- On limited versus polynomial nondeterminism (Q4259986) (← links)
- Improvement on vertex cover for low-degree graphs (Q4506265) (← links)
- \(\beta_k\)-complete problems and greediness (Q4529625) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Turing Machines with Atoms (Q5271055) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- Component order connectivity in directed graphs (Q6068236) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- The parameterized complexity of terminal monitoring set (Q6575382) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
