No label defined (Q5111868)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7205193

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7205193

Statements

scholarly article

0 references

0 references

publication date

27 May 2020

0 references

full work available at URL

https://arxiv.org/abs/1706.09391

0 references

zbMATH Keywords

parameterized complexity

0 references

relativization

0 references

interactive proof systems

0 references

MaRDI profile type

MaRDI publication profile

0 references

Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues

0 references

Computational Complexity

0 references

Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

0 references

Computer Science Logic

0 references

Machine-based methods in parameterized complexity theory

0 references

0 references

Fundamentals of parameterized complexity

0 references

Fixed-Parameter Tractability, Definability, and Model-Checking

0 references

Parametrized complexity theory.

0 references

0 references

Parameterized random complexity

0 references

0 references

0 references

0 references

PP is as Hard as the Polynomial-Time Hierarchy

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.IPEC.2017.9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5111868

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5111868&oldid=36588764"