Similar Papers

Paper Title
Journal
Date
Author
A sieve algorithm based on overlattices
Anja Becker ... Nicolas Gama
LMS Journal of Computation and Mathematics | VOL. 17
Anja Becker, et. al.Anja Becker ... Nicolas Gama
01 Jan 2014
Discrete Gaussian Sampling Reduces to CVP and SVP
Noah Stephens-Davidowitz
-
Noah Stephens-DavidowitzNoah Stephens-Davidowitz
21 Dec 2015
Shortest Vector Problem
Daniele Micciancio ... Shafi Goldwasser
-
Daniele Micciancio, et. al.Daniele Micciancio ... Shafi Goldwasser
01 Jan 2002
On the Limits of Nonapproximability of Lattice Problems
Oded Goldreich ... Shafi Goldwasser
Journal of Computer and System Sciences | VOL. 60
Oded Goldreich, et. al.Oded Goldreich ... Shafi Goldwasser
01 Jun 2000
View more papers

More From: SIAM Journal on Computing

Paper Title
Journal
Date
Author
Almost-Ramanujan Expanders From Arbitrary Expanders via Operator Amplification
Fernando Granha Jeronimo ... Avi Wigderson
SIAM Journal on Computing | VOL. -
Fernando Granha Jeronimo, et. al.Fernando Granha Jeronimo ... Avi Wigderson
27 Jan 2025
Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
Jane Lange ... Arsen Vasilyan
SIAM Journal on Computing | VOL. -
Jane Lange, et. al.Jane Lange ... Arsen Vasilyan
23 Jan 2025
Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank
Taihei Oki ... Tasuku Soma
SIAM Journal on Computing | VOL. 54
Taihei Oki, et. al.Taihei Oki ... Tasuku Soma
16 Jan 2025
Fitting Metrics and Ultrametrics with Minimum Disagreements
Vincent Cohen-Addad ... Arnaud De Mesmay
SIAM Journal on Computing | VOL. 54
Vincent Cohen-Addad, et. al.Vincent Cohen-Addad ... Arnaud De Mesmay
15 Jan 2025
View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.