Bounded fixed-parameter tractability and reducibility
From MaRDI portal
Publication:2382273
Recommendations
Cites work
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Graph minors. XIII: The disjoint paths problem
- Machine-based methods in parameterized complexity theory
- On fixed-parameter tractability and approximability of NP optimization problems
- On the Amount of Nondeterminism and the Power of Verifying
- On the structure of parameterized problems in NP
- Parameterized and Exact Computation
- Parametrized complexity theory.
- Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
- The complexity of first-order and monadic second-order logic revisited
Cited in
(7)- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- scientific article; zbMATH DE number 1747699 (Why is no real title available?)
- A basic parameterized complexity primer
- Automata, Languages and Programming
- Parameterized and Exact Computation
- scientific article; zbMATH DE number 512844 (Why is no real title available?)
- Modified parameterized complexity theory
This page was built for publication: Bounded fixed-parameter tractability and reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2382273)