On the Computation of g(k) in Waring's Problem

DOI10.2307/2008517zbMATH Open0701.11043OpenAlexW4246198935MaRDI QIDQ3478478

Francine Delmer, Jean-Marc Deshouillers

Publication date: 1990

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2008517

zbMATH Keywords

algorithmsWaring problem

Mathematics Subject Classification ID

Waring's problem and variants (11P05) Number-theoretic algorithms; complexity (11Y16) Diophantine inequalities (11J25)

Related Items (5)

A new lower bound for \(\|(3/2)^k\|\) ⋮ Computers as a novel mathematical reality. II: Waring's problem ⋮ Title not available (Why is that?) ⋮ Représentations des groupes et identités polynomiales ⋮ Effectivization of a lower bound for \(\| (4/3)^k\| \)

This page was built for publication: On the Computation of g(k) in Waring's Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3478478)