On the knowledge complexity of \(\mathcal N\mathcal P\)

DOI10.1007/s004930200005zbMath0997.68062OpenAlexW2177204320MaRDI QIDQ1848028

Gábor Tardos, Erez Petrank

Publication date: 30 October 2002

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

knowledge complexity of NP

Mathematics Subject Classification ID

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 knowledge complexity of \(\mathcal N\mathcal P\)