Author

Miklós Ajtai

Created by ACM worker at 2019-04-09 18:00:00.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Carlos Alberto Meier Basso's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

A sieve algorithm for the shortest lattice vector problem

Published At

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98

Co-Authors

Ravi Kumar

D. Sivakumar

Referenced By

(Gap/S)ETH hardness of SVP

Tensor-based hardness of the shortest vector problem to within almost polynomial factors