On the complexity of hard enumeration problems

DOI10.1007/978-3-319-53733-7_13MaRDI QIDQ6828216zbMATH OpenFDO

Authors Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer

Publication date 1 June 2017

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: On the complexity of hard enumeration problems

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