Sciweavers

68
Voted
FOCS
1993
IEEE
15 years 1 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch