Computing and Combinatorics

DOI10.1007/11533719zbMath1123.68333OpenAlexW4376561447MaRDI QIDQ5717013

Mayur Thakur, Hemaspaandra, Lane A.

Publication date: 11 January 2006

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

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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Query-monotonic Turing reductions

This page was built for publication: Computing and Combinatorics