Characterizations and Existence of Easy Sets without Hard Subsets
From MaRDI portal
Publication:3100945
DOI10.3233/FI-2011-546zbMath1234.68123OpenAlexW1934598621MaRDI QIDQ3100945
Publication date: 22 November 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2011-546
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: Characterizations and Existence of Easy Sets without Hard Subsets