796 search results - page 13 / 160 » Approximating the centroid is hard |
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
ASIACRYPT
1999
Springer
13 years 11 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
FOCS
1992
IEEE
13 years 11 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 ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer