Dirichlet’s proof of the three-square theorem: An algorithmic perspective
From MaRDI portal
Publication:4561383
DOI10.1090/mcom/3349zbMath1412.11067OpenAlexW2784118590MaRDI QIDQ4561383
Publication date: 5 December 2018
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3349
Sums of squares and representations by other particular quadratic forms (11E25) Computer solution of Diophantine equations (11Y50)
Related Items (3)
Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ Computers as a novel mathematical reality. II: Waring's problem ⋮ Efficient range proofs with transparent setup from bounded integer commitments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Even faster integer multiplication
- On the computation of quadratic 2-class groups
- A generalization of a method of Mordell to ternary quadratic forms
- Modern Computer Arithmetic
- Statistical Evidence for Small Generating Sets
- Faster Integer Multiplication
- Randomized algorithms in number theory
- On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- A Rigorous Time Bound for Factoring Integers
- Almost-primes in arithmetic progressions and short intervals
- A lower bound for the least prime in an Arithmetic progression
- Explicit bounds for primes in residue classes
- Conditional bounds for the least quadratic non-residue and related problems
This page was built for publication: Dirichlet’s proof of the three-square theorem: An algorithmic perspective