scientific article; zbMATH DE number 6028122
From MaRDI portal
Publication:5389345
zbMath1236.03031MaRDI QIDQ5389345
Publication date: 26 April 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Higher degree equations; Fermat's equation (11D41) Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32)
Related Items
A Program-Size Complexity Measure for Mathematical Problems and Conjectures ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ The Riemann hypothesis as the parity of special binomial coefficients ⋮ Inductive Complexity of P versus NP Problem ⋮ The complexity of Euler's integer partition theorem ⋮ The Riemann hypothesis in computer science