Relativization and interactive proof systems in parameterized complexity theory
From MaRDI portal
Publication:5111868
Recommendations
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- A simple proof of Toda's theorem
- Computational Complexity
- Computer Science Logic
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Fixed-parameter tractability, definability, and model-checking
- Fundamentals of parameterized complexity
- IP = PSPACE
- IP = SPACE
- Machine-based methods in parameterized complexity theory
- PP is as Hard as the Polynomial-Time Hierarchy
- Parameterized random complexity
- Parametrized complexity theory.
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Cited in
(6)- Some definitorial suggestions for parameterized proof complexity
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- scientific article; zbMATH DE number 176510 (Why is no real title available?)
- scientific article; zbMATH DE number 7378390 (Why is no real title available?)
- Parameterised counting in logspace
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)
This page was built for publication: Relativization and interactive proof systems in parameterized complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111868)
