On Bounded Queries and Approximation

DOI10.1137/S0097539794266481zbMath0868.68067MaRDI QIDQ4337440

Richard Chang, Carstent Lund, William I. Gasarch

Publication date: 3 August 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Structure in approximation classes ⋮ Bounded queries, approximations, and the Boolean hierarchy

This page was built for publication: On Bounded Queries and Approximation