FOCS
1992
IEEE
14 years 3 months ago
1992
IEEE
: We prove in this paper that it is much harder to evaluate depth
FOCS
1992
IEEE
14 years 3 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
FOCS
1992
IEEE
14 years 3 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
GI
1991
Springer
14 years 3 months ago
1991
Springer
FOCS
1991
IEEE
14 years 3 months ago
1991
IEEE
FOCS
1991
IEEE
14 years 3 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...
CTRS
1994
14 years 3 months ago
1994
FOCS
1991
IEEE
14 years 3 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
FOCS
1991
IEEE
14 years 3 months ago
1991
IEEE
FOCS
1991
IEEE
14 years 3 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...