scientific article; zbMATH DE number 7205193
From MaRDI portal
Publication:5111868
DOI10.4230/LIPICS.IPEC.2017.9zbMATH Open1443.68070arXiv1706.09391MaRDI QIDQ5111868FDOQ5111868
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1706.09391
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- Computational Complexity
- Parametrized complexity theory.
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- PP is as Hard as the Polynomial-Time Hierarchy
- IP = PSPACE
- Machine-based methods in parameterized complexity theory
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- IP = SPACE
- Fixed-parameter tractability, definability, and model-checking
- Computer Science Logic
- Parameterized random complexity
Cited In (5)
- Parameterised counting in logspace
- Title not available (Why is that?)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)
- Title not available (Why is that?)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111868)
