Author of the publication

On the Limits of Nonapproximability of Lattice Problems.

, and . J. Comput. Syst. Sci., 60 (3): 540-563 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Property Testing in Bounded Degree Graphs, and . Algorithmica, 32 (2): 302-343 (2002)On our duties as scientists.. SIGACT News, 40 (3): 53-59 (2009)A taxonomy of proof systems (part 2).. SIGACT News, 25 (1): 22-30 (1994)Improved Derandomization of BPP Using a Hitting Set Generator., and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 131-137. Springer, (1999)The Minimum-Length Generator Sequence Problem is NP-Hard., and . J. Algorithms, 2 (3): 311-313 (1981)Three theorems regarding testing graph properties, and . Random Struct. Algorithms, 23 (1): 23-57 (2003)On the Limits of Non-Approximability of Lattice Problems., and . STOC, page 1-9. ACM, (1998)Property Testing in Bounded Degree Graphs., and . STOC, page 406-415. ACM, (1997)Adaptively Secure Multi-Party Computation., , , and . STOC, page 639-648. ACM, (1996)Source to Destination Communication in the Presence of Faults., , and . PODC, page 85-101. ACM, (1989)