Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

DOI10.1007/978-3-662-46078-8_18zbMath1370.68145OpenAlexW150847977MaRDI QIDQ5175107

Stefan Szeider, Ronald de Haan

Publication date: 20 February 2015

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-46078-8_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Parameterized complexity classes beyond para-NP ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph

This page was built for publication: Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP