betaFeedback

WorksComputer Science

Deterministic Parameterized Inapproximability of the Shortest Vector and Minimum Distance Problems

Abstract

The Shortest Vector Problem (SVP) and the Minimum Distance Problem (MDP) are central computational problems on lattices and linear codes, respectively. For every computable real p≥1p\ge1 and any constant factor, we prove that the parameterized SVP in the ℓp\ell_p norm, with the distance threshold as the parameter, is W[1]-hard to approximate within factor γγ under deterministic reductions. The same method shows that, for every finite field, the parameterized MDP is W[1]-hard to approximate within any constant factor under deterministic reductions.

Introduction

The Shortest Vector Problem (SVP) asks for the minimum ℓp\ell_p norm of a nonzero vector in a given integer lattice. It is the central computational problem on lattices, with applications to algorithms and cryptography [AEVZ02; Pei16]. For finite ℓp\ell_p norms, the hardness of SVP was long known only under randomized reductions, and removing this randomness has been a major challenge.

In the classical setting of NP-hardness, this challenge has recently been met. Van Emde Boas [vEmd81] proved that SVP in the ℓ∞\ell_\infty norm is NP-hard and conjectured the same for the Euclidean norm. Ajtai [3] proved this conjecture under randomized reductions, and subsequent work proved the hardness of approximating SVP in every finite ℓp\ell_p norm, again under randomized reductions [31, 29, 24, 32]. The first deterministic hardness results for SVP in finite ℓp\ell_p norms appeared only recently. For every p>2p > 2, Hair and Sahai [27] proved that approximating SVP is NP-hard under deterministic polynomial-time reductions, later even within polynomial factors [26], and Hecht and Safra [28] proved hardness under deterministic subexponential-time reductions. Hair and Sahai [25] then extended hardness under subexponential-time reductions to every finite ℓp\ell_p norm. Wan [Wan26b] resolved the conjecture of van Emde Boas: for every p≥1p \ge1, approximating SVP in the ℓp\ell_p norm within any factor below 21/p2^{1/p} is NP-hard under deterministic polynomial-time reductions. Wan [Wan26a] later extended this result to every constant factor in every finite ℓp\ell_p norm.

The situation is, however, different in parameterized complexity. A problem with a parameter kk is fixed-parameter tractable (FPT) if it can be solved in time f(k)⋅nO(1)f(k) \cdot n^{O(1)} for some computable function ff, where nn is the input length. The standard evidence that a problem is not FPT is its W[1]-hardness under FPT reductions, which plays the role of NP-hardness [16 CFK+15]. For SVP, the natural parameter is the distance threshold dd, and exhaustive search over the integer vectors with at most dpd^p nonzero coordinates solves SVP in time (dn)O(dp)(dn)^{O(d^p)}. Downey, Fellows, Vardy, and Whittle [DFVW99] asked whether SVP is W[1]-hard, together with the same question for the parameterized Minimum Distance Problem (MDP) on linear codes, whose natural parameter is also the distance threshold kk; in their framework, W[1]-hardness refers to the standard deterministic FPT reductions. For binary codes, MDP is equivalent to the kk-Even Set problem, whose fixed-parameter tractability remained a central open problem in parameterized complexity for almost two decades [16].

Bhattacharyya, Bonnet, Egri, Ghoshal, Karthik C. S., Lin, Manurangsi, and Marx [BBE+21] answered both questions under randomized reductions. They proved that, for every p>1p > 1, approximating SVP in the ℓp\ell_p norm within some constant factor is W[1]-hard, and that approximating MDP over F2\mathbb{F}_2 within any constant factor is W[1]-hard. Bennett, Cheraghchi, Guruswami, and Ribeiro [7] extended these results to SVP in every finite ℓp\ell_p norm and to MDP over every finite field, again under randomized reductions. Both works asked for deterministic reductions [BBE+21, Section 8], and Bennett, Cheraghchi, Guruswami, and Ribeiro [7] called finding them a groundbreaking contribution. Hirahara and Ogitsuka [23] gave one-sided-error reductions, which always map NO instances to NO instances, for MDP within every constant factor and for SVP within every factor below 21/p2^{1/p}. They then derandomized these reductions under the assumption that some problem solvable in time 2O(n)2^{O(n)} requires nondeterministic circuits of size 2Ω(n)2^{\Omega(n)}. For MDP, Guruswami and Ren [21] very recently gave an unconditional deterministic reduction, using an elementary construction based on Reed–Muller codes. For SVP, no unconditional deterministic reduction was known.

Our Results

We prove the parameterized hardness of SVP under deterministic reductions. For a constant γ≥1\gamma\ge1, the promise problem γ\gamma-GapSVPp_p asks us to distinguish integer lattices that contain a nonzero vector of ℓp\ell_p norm at most dd from those in which every nonzero vector has norm greater than γd\gamma d; the parameter is dd (see Definition 2.2).

Theorem 1.1. For every computable1 real p≥1p \ge1 and every constant γ∈[1,21/p)\gamma\in[1,2^{1/p}), γ\gamma-GapSVPp_p is W[1]-hard under deterministic FPT many-one reductions.

Theorem 1.1 answers the question of Downey, Fellows, Vardy, and Whittle [DFVW99] for SVP with deterministic reductions, as well as the question of [BBE+21; BCGR24]: it gives the first deterministic reduction that proves the W[1]-hardness of SVP without any assumption. Previously, even for exact SVP in the Euclidean norm, W[1]-hardness under deterministic reductions was known only under the circuit lower-bound assumption of [23]. Its range of approximation factors is the same as that of the one-sided-error reductions of [23] and of the deterministic NP-hardness for general pp in [Wan26b].

Combined with an improved version of the tensor-product amplification of Wan [Wan26a], our approach extends to every constant factor.

Theorem 1.2. For every computable real p≥1p \ge1 and every constant γ≥1\gamma\ge1, γ\gamma-GapSVPp_p is W[1]-hard under deterministic FPT many-one reductions.

Theorem 1.2 is the parameterized analogue of the deterministic NP-hardness of [Wan26a]. For p>1p > 1, its range of approximation factors matches that of the randomized reduction of [7]; for p=1p = 1, it goes beyond their range, which consists of the factors below 2. We prove Theorem 1.2 in Section A: we reduce from the Maximum Likelihood Decoding Problem using the construction of Theorem 3.2, and then amplify the gap by taking tensor powers.

The same method applies to MDP. For a constant γ≥1\gamma\ge1, the problem γ\gamma-GapMDPq_q asks us to distinguish linear codes over Fq\mathbb{F}_q that contain a nonzero codeword of Hamming weight at most kk from those in which every nonzero codeword has weight greater than γk\gamma k (see Definition 2.5).

Theorem 1.3. For every prime power q≥2q \ge2 and every constant γ≥1\gamma\ge1, γ\gamma-GapMDPq_q is W[1]-hard under deterministic FPT many-one reductions.

Guruswami and Ren [21] proved Theorem 1.3 with a different, elementary construction, starting from the exact nearest codeword problem. In their reduction, the output threshold grows exponentially with the input threshold kk. In ours, it grows linearly: before the final amplification, our reduction maps the approximate nearest codeword problem with threshold kk to MDP with threshold (4p−1)k(4p - 1)k over Fp\mathbb{F}_p (Theorem 4.4).

Guruswami and Ren also mention a reduction with a linear threshold and essentially the same parameters as ours, which GPT-6 discovered using algebraic geometry, but they did not include it because they had not carefully verified its proof [21 Footnote 1]. Our main technical contribution is to identify a finite-field version of the implicit function theorem (see Lemma 2.19) as the key idea underlying the algebraic argument, and to give a short proof using standard facts about curves over finite fields.

Technical Overview

Our reductions build directly on those of Hirahara and Ogitsuka [23]. Hirahara and Ogitsuka build on the reductions of Bennett, Cheraghchi, Guruswami, and Ribeiro [7], which adapt the approach developed by Khot [29] for proving NP-hardness of SVP to the parameterized setting. Hirahara and Ogitsuka guarantee soundness deterministically, leaving randomness only for completeness. We make completeness deterministic as well. Thus, our approach can be viewed as a derandomized version of Khot’s approach. In these approaches, the reduction to SVP starts from its inhomogeneous version, the Closest Vector Problem (CVP). Similarly, the reduction to the Minimum Distance Problem starts from its inhomogeneous version, the Nearest Codeword Problem (NCP). We explain the reduction for SVP and then the changes for MDP.

The Reduction for the Shortest Vector Problem

Previous randomized approach. We briefly recall the reduction of Hirahara and Ogitsuka [23], on which our reduction is based. It starts from an instance (B,t,d)(B,t,d) of CVP with approximation factor γ\gamma, where B∈Zm×nB \in\mathbb{Z}^{m \times n} is a basis matrix, t∈Zmt \in\mathbb{Z}^m is a target vector, and dd is a positive integer. This problem asks whether there exists x∈Znx \in\mathbb{Z}^n with ∥Bx−t∥p≤d\lVert Bx - t\rVert_p \le d. In a NO instance, not only tt but every nonzero integer multiple of tt is far from the lattice: ∥Bx−ℓt∥p>γd\lVert Bx - \ell t\rVert_p > \gamma d for every x∈Znx \in\mathbb{Z}^n and every nonzero integer ℓ\ell. The problem remains W[1]-hard with this stronger NO condition. The reduction uses a locally dense lattice with basis AA and center ss. Informally, a locally dense lattice refers to a lattice with many lattice points lying in a ball centered at ss whose radius is smaller than the length of a shortest nonzero lattice vector. In [7, 23], the basis A\mathbf{A} is constructed deterministically so that the lattice it generates has minimum norm greater than γd\gamma d. The center s\mathbf{s} is chosen randomly to obtain many short vectors Ay−s\mathbf{A}\mathbf{y}-\mathbf{s}.

For a suitable prime q>γdq>\gamma d and an integer β>γd\beta>\gamma d, the output lattice consists of vectors of the form

(B0−t00A−s00010βPBβRA−β(Pt+Rs)βqI)(xyℓz)=(Bx−ℓtAy−ℓsℓβ(P(Bx−ℓt)+R(Ay−ℓs)+qz)),\begin{pmatrix} \mathbf{B} & \mathbf{0} & -\mathbf{t} & \mathbf{0}\\ \mathbf{0} & \mathbf{A} & -\mathbf{s} & \mathbf{0}\\ \mathbf{0} & \mathbf{0} & 1 & \mathbf{0}\\ \beta\mathbf{P}\mathbf{B} & \beta\mathbf{R}\mathbf{A} & -\beta(\mathbf{P}\mathbf{t}+\mathbf{R}\mathbf{s}) & \beta q\mathbf{I} \end{pmatrix} \begin{pmatrix} \mathbf{x}\\ \mathbf{y}\\ \ell\\ \mathbf{z} \end{pmatrix} = \begin{pmatrix} \mathbf{B}\mathbf{x}-\ell\mathbf{t}\\ \mathbf{A}\mathbf{y}-\ell\mathbf{s}\\ \ell\\ \beta\bigl(\mathbf{P}(\mathbf{B}\mathbf{x}-\ell\mathbf{t})+\mathbf{R}(\mathbf{A}\mathbf{y}-\ell\mathbf{s})+q\mathbf{z}\bigr) \end{pmatrix},

where x,y,z\mathbf{x},\mathbf{y},\mathbf{z} are integer vectors and ℓ\ell is an integer. Here P\mathbf{P} is a deterministically constructed parity-check matrix that maps every nonzero integer vector of ℓp\ell_p norm at most γd\gamma d to a nonzero vector modulo qq. The matrix R\mathbf{R} is chosen randomly, and both matrices are represented by integer entries. The coefficient ℓ\ell multiplies both targets, and the last block vanishes for some integer vector z\mathbf{z} if and only if

P(Bx−ℓt)+R(Ay−ℓs)=0(modq).\mathbf{P}(\mathbf{B}\mathbf{x}-\ell\mathbf{t})+\mathbf{R}(\mathbf{A}\mathbf{y}-\ell\mathbf{s})=0 \pmod q.

To prove completeness, let x\mathbf{x} satisfy ∥Bx−t∥p≤d\lVert\mathbf{B}\mathbf{x}-\mathbf{t}\rVert_p\le d. By the local density, with high probability over the random choice of s\mathbf{s}, there are many integer vectors y\mathbf{y} for which Ay−s\mathbf{A}\mathbf{y}-\mathbf{s} is short. Since there are many such short vectors, with high probability over the random choice of R\mathbf{R}, one of them is mapped to the required vector, that is,

R(Ay−s)=−P(Bx−t)(modq).(1)\mathbf{R}(\mathbf{A}\mathbf{y}-\mathbf{s})=-\mathbf{P}(\mathbf{B}\mathbf{x}-\mathbf{t}) \pmod q. \tag*{(1)}

Setting ℓ=1\ell=1 and choosing z\mathbf{z} so that the last block vanishes gives a short nonzero output vector.

Soundness holds for every choice of s\mathbf{s} and R\mathbf{R} [23 Theorem 3.9], so randomness is needed only for completeness.

Our approach: deterministic reduction with locally dense lattices. Our reduction is obtained from the reduction of Hirahara and Ogitsuka [23] by a specific choice of P\mathbf{P} and R\mathbf{R} and by removing the columns βqI\beta q\mathbf{I}. Let Λ\Lambda be the lattice generated by A\mathbf{A}, and fix an ordered list SS of its coordinates. We write v∣S\mathbf{v}|_S for the restriction of a vector v\mathbf{v} to the coordinates in SS, in the specified order, and AS\mathbf{A}_S for the corresponding rows of A\mathbf{A}. We take P=I\mathbf{P}=\mathbf{I} and let R\mathbf{R} be the negative of the restriction map to SS, that is, Rv=−v∣S\mathbf{R}\mathbf{v}=-\mathbf{v}|_S. Thus R\mathbf{R} is no longer random, and we also choose the center s\mathbf{s} deterministically, with s∣S=0\mathbf{s}|_S=0. With these choices, Equation (1) becomes

(Ay−s)∣S=Bx−t(modq)(\mathbf{A}\mathbf{y}-\mathbf{s})|_S=\mathbf{B}\mathbf{x}-\mathbf{t} \pmod q.

Since we remove the columns βqI\beta q\mathbf{I}, which account for the reduction modulo qq, we require this to hold as an equality of integer vectors:

(Ay−s)∣S=Bx−t.(\mathbf{A}\mathbf{y}-\mathbf{s})|_S=\mathbf{B}\mathbf{x}-\mathbf{t}.

To satisfy this for every YES instance without randomness, every short vector in Zm\mathbb{Z}^m must be the restriction to SS of some short vector in Λ−s\Lambda-\mathbf{s}. In [23], a locally dense lattice consists only of the basis A\mathbf{A} and the center s\mathbf{s}, and the random matrix R\mathbf{R} is responsible for satisfying Equation (1). We instead include the list SS in our locally dense lattice and construct s\mathbf{s} and SS deterministically so that the restriction to SS plays this role.

Accordingly, our locally dense lattice consists of a lattice Λ\Lambda whose minimum ℓp\ell_p norm is greater than γd\gamma d, a center s\mathbf{s}, and an ordered list SS of coordinates with s∣S=0\mathbf{s}|_S=0, such that every short vector in Zm\mathbb{Z}^m is the restriction to SS of a short vector in Λ−s\Lambda-\mathbf{s}:

For every u∈Zm with ∥u∥p≤d, some w∈Λ−s with ∥w∥p≤W satisfies w∣S=u.(2)\text{For every }\mathbf{u}\in\mathbb{Z}^m\text{ with }\lVert\mathbf{u}\rVert_p\le d,\text{ some }\mathbf{w}\in\Lambda-\mathbf{s}\text{ with }\lVert\mathbf{w}\rVert_p\le W\text{ satisfies }\mathbf{w}|_S=\mathbf{u}. \tag*{(2)}

Condition Equation (2) is our counterpart of Equation (1). Taking u=Bx−tu = \mathbf{B}x - t, it guarantees the equality above for every xx with ∥Bx−t∥p≤d\lVert\mathbf{B}x - t\rVert_p \le d, without any randomness.

For an integer β>γd\beta> \gamma d, given a locally dense lattice (Λ,s,S)(\Lambda, s, S) satisfying Equation (2) as advice, the reduction deterministically outputs a lattice consisting of vectors of the form

(B0−t0A−s001βB−βAS−βt)(xyℓ)=(Bx−ℓtAy−ℓsℓβ(Bx−ℓt−ASy)),\begin{pmatrix} \mathbf{B} & 0 & -t \\ 0 & \mathbf{A} & -s \\ 0 & 0 & 1 \\ \beta\mathbf{B} & -\beta\mathbf{A}S & -\beta t \end{pmatrix} \begin{pmatrix} x\\ y\\ \ell \end{pmatrix} = \begin{pmatrix} \mathbf{B}x-\ell t\\ \mathbf{A}y-\ell s\\ \ell\\ \beta(\mathbf{B}x-\ell t-\mathbf{A}S y) \end{pmatrix},

where x,yx,y are integer vectors and ℓ\ell is an integer.

References

  1. [2]Divesh Aggarwal, Rishav Gupta, Aditya Morolia, and Chuanqi Zhang. “Mind the Gap? Not for SVP Hardness Under ETH!” In: ICALP. Vol. 374. LIPIcs. 2026, 8:1–8:24. DOI: 10.4230/LIPIcs.ICALP.2026.8 (cit. on p. 9).DOI
  2. [3]Miklós Ajtai. “The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)”. In: STOC. 1998 (cit. on pp. 1, 9).DOI
  3. [4]Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. “PRIMES Is in P”. In: Annals of Mathematics 160.2 (2004), pp. 781–793 (cit. on p. 13).DOI
  4. [5]Divesh Aggarwal and Noah Stephens-Davidowitz. “(Gap/S)ETH hardness of SVP”. In: STOC. 2018 (cit. on p. 9).DOI
  5. [7]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, and João Ribeiro. “Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms”. In: SIAM Journal on Computing 53.5 (2024). Preliminary version in STOC 2023., pp. 1439–1475 (cit. on pp. 2, 3, 11, 12, 36).
  6. [8]Huck Bennett and Chris Peikert. “Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes”. In: APPROX/RANDOM. Full version; theorem numbering refers to arXiv:2202.07736v1. 2023. DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.37. arXiv: 2202.07736v1 (cit. on pp. 5, 9, 17, 19).DOI
  7. [10]Claude (Anthropic). A 2^{o(n)} Time Algorithm for 3-SAT. Preprint. 2026. URL: https://github.com/anthropics/formal-math/blob/main/eth/paper.pdf (cit. on p. 9).
  8. [12]John H. Conway and Neil J. A. Sloane. Sphere Packings, Lattices, and Groups. Springer, 1999 (cit. on p. 9).
  9. [13]Qi Cheng and Daqing Wan. “A Deterministic Reduction for the Gap Minimum Distance Problem”. In: IEEE Transactions on Information Theory 58.11 (2012). Preliminary version in STOC 2009., pp. 6935–6941 (cit. on p. 9).
  10. [14]Rodney G. Downey and Michael R. Fellows. “Fixed-Parameter Tractability and Completeness I: Basic Results”. In: SIAM Journal on Computing 24.4 (1995), pp. 873–921 (cit. on p. 11).DOI
  11. [15]Rodney G. Downey and Michael R. Fellows. “Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]”. In: Theoretical Computer Science 141.1–2 (1995), pp. 109–131 (cit. on p. 11).DOI
  12. [16]Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer, 1999 (cit. on pp. 1, 2, 11).
  13. [18]Ilya Dumer, Daniele Micciancio, and Madhu Sudan. “Hardness of approximating the minimum distance of a linear code”. In: IEEE Transactions on Information Theory 49.1 (2003). Preliminary version in FOCS 1999., pp. 22–37 (cit. on pp. 9, 12).
  14. [19]Oded Goldreich and Shafi Goldwasser. “On the Limits of Nonapproximability of Lattice Problems”. In: Journal of Computer and System Sciences 60.3 (2000). Preliminary version in STOC 1998., pp. 540–563. DOI: 10.1006/jcss.1999.1686 (cit. on p. 11).
  15. [20]Meinolf Geck and Gunter Malle. Reductive groups and Steinberg maps. 2016. arXiv: 1608.01156 [math.RT]. URL: https://arxiv.org/abs/1608.01156v1 (cit. on pp. 14, 15).
  16. [21]Venkatesan Guruswami and Xuandi Ren. Deterministic Parameterized Inapproximability of Nearest Codeword and Minimum Distance. Electronic Colloquium on Computational Complexity (ECCC), Report TR26-234, 2026. URL: https://eccc.weizmann.ac.il/report/2026/234/ (cit. on pp. 2, 3).
  17. [22]Zeyu Guo, Ben Lee Volk, Akhil Jalan, and David Zuckerman. “Extractors for Images of Varieties”. In: STOC. Full version: arXiv:2211.14497; numbering refers to the full version. 2023, pp. 46–59. DOI: 10.1145/3564246.3585109 (cit. on pp. 15, 16).DOI
  18. [23]Shuichi Hirahara and Kazuki Ogitsuka. “One-Sided-Error Parameterized Reductions for the Minimum Distance and Shortest Vector Problems”. In: APPROX/RANDOM. Full version; theorem numbering refers to arXiv:2608.14305v1. 2026. arXiv: 2608.14305v1 (cit. on pp. 2–4, 7, 9, 17, 18, 25, 26).arxiv.org/abs/2608.14305
  19. [24]Ishay Haviv and Oded Regev. “Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors”. In: Theory of Computing 8.23 (2012). Preliminary version in STOC 2007., pp. 513–531 (cit. on pp. 1, 9).
  20. [25]Isaac M Hair and Amit Sahai. Deterministic Hardness of Approximation For SVP in all Finite ℓp Norms. To appear in FOCS 2026. 2026. arXiv: 2604.01451 [cs.CC]. URL: https://arxiv.org/abs/2604.01451 (cit. on p. 1).
  21. [26]Isaac M. Hair and Amit Sahai. Polynomial-Factor Deterministic NP-Hardness for SVP in Every ℓp Norm with p > 2. 2026. arXiv: 2608.14529. URL: https://arxiv.org/abs/2608.14529 (cit. on pp. 1, 9).
  22. [27]Isaac M. Hair and Amit Sahai. “SVPₚ Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of 2^{log¹⁻ε n}”. In: STOC. 2026, pp. 1716–1727. DOI: 10.1145/3798129.3800879 (cit. on p. 1).
  23. [28]Yahli Hecht and Muli Safra. “Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓp Norms for p > 2”. In: STOC. 2026, pp. 886–897. DOI: 10.1145/3798129.3800803 (cit. on p. 1).DOI
  24. [29]Subhash Khot. “Hardness of approximating the shortest vector problem in lattices”. In: Journal of the ACM 52.5 (2005). Preliminary version in FOCS 2004., pp. 789–808 (cit. on pp. 1, 3, 9).
  25. [30]Rudolf Lidl and Harald Niederreiter. Finite Fields. Second. Vol. 20. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, 1997 (cit. on p. 13).
  26. [31]Daniele Micciancio. “The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant”. In: SIAM Journal on Computing 30.6 (2001). Preliminary version in FOCS 1998., pp. 2008–2035 (cit. on pp. 1, 9).
  27. [32]Daniele Micciancio. “Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction”. In: Theory of Computing 8.22 (2012), pp. 487–512 (cit. on pp. 1, 9).
  28. [33]Daniele Micciancio. “Locally Dense Codes”. In: CCC. 2014 (cit. on p. 9).DOI
  29. [34]OpenAI. The Exponential Time Hypothesis is False. Preprint, revised October 25, 2026. 2026. URL: https://github.com/openai/math/blob/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/paper.pdf (cit. on p. 9).hub.valency.io/works/W_h8uqubsk
  30. [36]Walter Rudin. Principles of Mathematical Analysis. 3rd ed. New York: McGraw-Hill, 1976 (cit. on p. 16).
  31. [37]Wolfgang M. Schmidt. Equations over Finite Fields: An Elementary Approach. Vol. 536. Lecture Notes in Mathematics. Springer, 1976. DOI: 10.1007/BFb0080437 (cit. on p. 7).DOI

Paper details

vlnc:W_9n6ypdhb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents