The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract)
.
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, page 10--19. New York, NY, USA, ACM, (1998)

  • @ndbunner
  • @dblp
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).