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

DOI10.1007/978-3-662-60670-4zbMath1435.68010OpenAlexW2998684673MaRDI QIDQ2287640

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

Mathematics Subject Classification ID

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

Related Items (1)

Almost disjoint paths and separating by forbidden pairs

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