scientific article; zbMATH DE number 7378390
From MaRDI portal
Publication:5005177
DOI10.4230/LIPIcs.MFCS.2018.73MaRDI QIDQ5005177
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1712.05766
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Machine-based methods in parameterized complexity theory
- Simplifying the weft hierarchy
- Are there interactive protocols for co-NP languages?
- Which problems have strongly exponential complexity?
- Parametrized complexity theory.
- On the structure of parameterized problems in NP
- Limitations of the upward separation technique
- Relativizing Time, Space, and Time-Space
- IP = PSPACE
- Computational Complexity
This page was built for publication:
