14 search results - page 2 / 3 » focs 1993 |
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
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...
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...