scientific article; zbMATH DE number 7205193

DOI10.4230/LIPIcs.IPEC.2017.9zbMath1443.68070arXiv1706.09391MaRDI QIDQ5111868

Ralph Bottesch

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1706.09391

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relativizationinteractive proof systemsparameterized complexity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Parameterised counting in logspace ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Machine-based methods in parameterized complexity theory
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
• Parameterized random complexity
• Parametrized complexity theory.
• Fixed-Parameter Tractability, Definability, and Model-Checking
• PP is as Hard as the Polynomial-Time Hierarchy
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• IP = PSPACE
• IP = SPACE
• Computer Science Logic
• Computational Complexity

This page was built for publication: