Parameterized Derandomization
From MaRDI portal
Publication:3503586
DOI10.1007/978-3-540-79723-4_15zbMath1142.68361OpenAlexW2914156610MaRDI QIDQ3503586
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
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items (3)
The Birth and Early Years of Parameterized Complexity ⋮ Parameterized random complexity ⋮ Confronting intractability via parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Machine-based methods in parameterized complexity theory
- Parameterized circuit complexity and the \(W\) hierarchy
- The parameterized complexity of maximality and minimality problems
- Parametrized complexity theory.
- PP is as Hard as the Polynomial-Time Hierarchy
- Resolution Is Not Automatizable Unless W[P Is Tractable]
- Randomized Approximations of Parameterized Counting Problems
- Towards a Taxonomy of Techniques for Designing Parameterized Algorithms
This page was built for publication: Parameterized Derandomization
