On the Advice Complexity of Tournaments
From MaRDI portal
Publication:2914350
DOI10.1007/978-3-642-32241-9_40zbMath1364.68214OpenAlexW156363032MaRDI QIDQ2914350
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_40
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 Advice Complexity of Tournaments