Cover Image

NP-hardness of SVP in Euclidean Space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wan, Daqing
Format:	Preprint
Published:	2026
Subjects:	Number Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

NP-hardness of p-adic linear regression
by: Baker, Gregory D.
Published: (2026)

Indefiniteness makes lattice reduction easier
by: Joux, Antoine
Published: (2025)

Recovering polynomials over finite fields from noisy character values
by: Kopparty, Swastik
Published: (2026)

Quasipolynomial bounds for the corners theorem
by: Jaber, Michael, et al.
Published: (2025)

On the degree of polynomials computing square roots mod p
by: Kedlaya, Kiran, et al.
Published: (2023)

Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)

A New Bound on Cofactors of Sparse Polynomials
by: Nahshon, Ido, et al.
Published: (2023)

Complexity of counting points on curves and the factor $P_1(T)$ of the zeta function of surfaces
by: Roy, Diptajit, et al.
Published: (2025)

A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
by: Umans, Chris, et al.
Published: (2025)

Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
by: Rai, Shanthanu S
Published: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

Diagonal Frobenius Number via Gomory's Relaxation and Discrepancy
by: Gribanov, Dmitry, et al.
Published: (2025)

Legendre compressions and an integrality conjecture for the Hörmander--Bernhardsson extremal function
by: Nguyen-Dang, Khai-Hoan
Published: (2026)

Density-based structural frameworks for prime numbers, prime gaps, and Euler products
by: Vettori, Gregorio
Published: (2026)

Admissibility of Hörmander--Bernhardsson extremal zeros
by: Nguyen-Dang, Khai-Hoan
Published: (2026)

On the Exceptional Set of Transcendental Entire Functions in Several Variables
by: Alves, Diego, et al.
Published: (2023)

Schoenberg's Theory of Totally Positive Functions and the Riemann Zeta Function
by: Gröchenig, Karlheinz
Published: (2020)

On a version of the Problem B of Mahler involving derivatives
by: Alves, Diego
Published: (2023)

Generalization of Siegel's Method to theta 1
by: Me'meh, Maher, et al.
Published: (2022)

Estimates for the number of zeros of shifted combinations of completed Dirichlet series
by: Ribeiro, Pedro
Published: (2024)

Mittag-Leffler type theorems for Helson zeta-functions
by: Andersson, Johan
Published: (2024)

Monodromies of singularities of the Hadamard and eñe product
by: Pérez-Marco, Ricardo
Published: (2020)

Non-real Poles and Irregularity of Distribution
by: Lowry-Duda, David
Published: (2019)

A Database of Continued Fractions of Polynomial Type
by: Cohen, Henri
Published: (2024)

Hyperbolicity and GCD for n+1 divisors with non-empty intersection
by: Wang, Julie Tzu-Yueh, et al.
Published: (2025)

Apéry Acceleration of Continued Fractions
by: Cohen, Henri
Published: (2024)

A $p$-adic Second Main Theorem
by: Huynh, Dinh Tuan
Published: (2024)

Regular Functions on Formal-Analytic Arithmetic Surfaces
by: Goodman, Samuel
Published: (2025)

Quaternionic Mahler measure
by: Wang, Weijia, et al.
Published: (2024)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
by: Romão, Leonardo Gasparini, et al.
Published: (2025)

King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
by: Baraskar, Omkar, et al.
Published: (2024)

Quantum Max-Cut is NP hard to approximate
by: Piddock, Stephen
Published: (2025)

Computing the EHZ capacity is NP-hard
by: Leipold, Karla, et al.
Published: (2024)

Prove Symbolic Regression is NP-hard by Symbol Graph
by: Song, Jinglu, et al.
Published: (2024)

Ramanujan's function on small primes
by: Brent, Barry
Published: (2025)

Complex solutions of polynomial equations on the unit circle
by: Aslanyan, Vahagn
Published: (2024)

The Existential Closedness and Zilber-Pink Conjectures
by: Aslanyan, Vahagn
Published: (2024)

Data Debugging is NP-hard for Classifiers Trained with SGD
by: Guo, Zizheng, et al.
Published: (2024)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
by: Silva, Lucas de Oliveira, et al.
Published: (2025)