Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy

DOI10.1007/978-3-662-60670-4zbMATH Open1435.68010OpenAlexW2998684673MaRDI QIDQ2287640FDOQ2287640

Authors: Ronald de Haan 

Publication date: 21 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-60670-4

Recommendations

• Parametrized complexity theory.
• Parameterized complexity: the main ideas and connections to practical computing
• Parameterized complexity classes beyond para-NP
• scientific article; zbMATH DE number 2183396
• Fundamentals of parameterized complexity

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (4)

• Title not available (Why is that?)
• Almost disjoint paths and separating by forbidden pairs
• More on BPP and the polynomial-time hierarchy
• Title not available (Why is that?)

This page was built for publication: Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287640)