1941 search results - page 13 / 389 » On the Hardness of Approximate Reasoning |
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
ASIACRYPT
1999
Springer
15 years 1 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...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
ESA
2004
Springer
15 years 1 months ago
2004
Springer
