scientific article
From MaRDI portal
Publication:2769072
zbMath1042.11529MaRDI QIDQ2769072
Publication date: 4 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Number-theoretic algorithms; complexity (11Y16) Continued fraction calculations (number-theoretic aspects) (11Y65) Factorization (11Y05)
Related Items (14)
The sharp threshold for making squares ⋮ Product representations of polynomials ⋮ Ternary arithmetic, factorization, and the class number one problem ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ A problem of Erdős–Graham–Granville–Selfridge on integral points on hyperelliptic curves ⋮ Fermat's method of factorisation ⋮ The factorisation of 267 − 1 ⋮ Parity check matrices and product representations of squares ⋮ Rigorous analysis of a randomised number field sieve ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ Infinitude of primes: Euclid's proof using angles between lattice vectors ⋮ Computation of orders and cycle lengths of automorphisms of finite solvable groups ⋮ New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants ⋮ Factorization of the tenth Fermat number
This page was built for publication:
