Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68368OpenAlexW2495578842MaRDI QIDQ5431320

Hubie Chen

Publication date: 7 December 2007

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

Full work available at URL: https://doi.org/10.1007/b11836

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)

Related Items (2)

\textsc{Inverse Hamiltonian cycle} and inverse \textsc{3Dimensional matching} are coNP-complete ⋮ All superlinear inverse schemes are coNP-hard

This page was built for publication: Mathematical Foundations of Computer Science 2003