On the complexity of diophantine geometry in low dimensions (extended abstract)

DOI10.1145/301250.301395zbMath1345.68181arXivmath/9811088OpenAlexW2110752522MaRDI QIDQ2819585

J. Maurice Rojas

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9811088

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability (number-theoretic aspects) (11U05) Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) (14G10) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Arithmetic varieties and schemes; Arakelov theory; heights (14G40) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Uncomputably large integral points on algebraic plane curves? ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ Some speed-ups and speed limits for real algebraic geometry