Advice classes of parametrized tractability
From MaRDI portal
Recommendations
- Corrigendum to: ``Advice classes of parameterized tractability
- The structure of logarithmic advice complexity classes
- Bounding the complexity of advice functions
- The advice complexity of a class of hard online problems
- Advice complexity for a class of online problems
- Nondeterministic Instance Complexity and Proof Systems with Advice
- Advice Automatic Structures and Uniformly Automatic Classes
- Complexity-Restricted Advice Functions
- Advice complexity and barely random algorithms
- Advice complexity and barely random algorithms
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 4051026 (Why is no real title available?)
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 140499 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- scientific article; zbMATH DE number 503190 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 512844 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 219251 (Why is no real title available?)
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Nondeterminism within $P^ * $
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- On the parameterized complexity of short computation and factorization
- Two strikes against perfect phylogeny
- Word Problems Solvable in Logspace
Cited in
(38)- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Approximation in (poly-) logarithmic space
- Studies in Computational Aspects of Voting
- Kernelization: new upper and lower bound techniques
- The structure of logarithmic advice complexity classes
- Incremental list coloring of graphs, parameterized by conservation
- A shortcut to (sun)flowers: kernels in logarithmic space or linear time
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- The birth and early years of parameterized complexity
- Corrigendum to: ``Advice classes of parameterized tractability
- Infeasibility of instance compression and succinct PCPs for NP
- On problems without polynomial kernels
- A general method to speed up fixed-parameter-tractable algorithms
- On the parametric complexity of schedules to minimize tardy tasks.
- Computing Hitting Set Kernels By AC^0-Circuits
- Win-win kernelization for degree sequence completion problems
- On the parallel parameterized complexity of MaxSAT variants
- Faster existential FO model checking on posets
- scientific article; zbMATH DE number 7053262 (Why is no real title available?)
- Finding points in general position
- On the space and circuit complexity of parameterized problems: classes and completeness
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- A parametric analysis of the state-explosion problem in model checking
- What Is Known About Vertex Cover Kernelization?
- The complexity of degree anonymization by vertex addition
- Surfing with Rod
- Approximation in (Poly-) Logarithmic Space
- Kernels in planar digraphs
- Space-efficient graph kernelizations
- New limits to classical and quantum instance compression
- Computing kernels in parallel: lower and upper bounds
- Parameterized analysis and crossing minimization problems
- Describing parameterized complexity classes
- Fractals for kernelization lower bounds
- The parameterized space complexity of embedding along a path
- Advice Automatic Structures and Uniformly Automatic Classes
- Parameterized complexity of critical node cuts
This page was built for publication: Advice classes of parametrized tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676315)
