Parameterized Derandomization

DOI10.1007/978-3-540-79723-4_15MaRDI QIDQ3503586zbMATH OpenOpenAlexFDO

Authors Moritz Müller

Publication date 5 June 2008

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79723-4_15

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Recommendations

• Parameterized random complexity
• Parameterized analogues of probabilistic computation
• Machine-based methods in parameterized complexity theory
• Randomized Approximations of Parameterized Counting Problems
• Parameterized circuit complexity and the \(W\) hierarchy

Cites work

• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1979521 (Why is no real title available?)
• Machine-based methods in parameterized complexity theory
• Parameterized circuit complexity and the \(W\) hierarchy
• Parametrized complexity theory.
• PP is as Hard as the Polynomial-Time Hierarchy
• Randomized Approximations of Parameterized Counting Problems
• Resolution Is Not Automatizable Unless W[P] Is Tractable
• The parameterized complexity of maximality and minimality problems
• Towards a Taxonomy of Techniques for Designing Parameterized Algorithms

Cited in

(4)

• Parameterized random complexity
• The birth and early years of parameterized complexity
• Confronting intractability via parameters
• Parameterized analogues of probabilistic computation

This page was built for publication: Parameterized Derandomization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503586)