Some results on computational complexity
From MaRDI portal
Publication:1239605
zbMath0361.68070MaRDI QIDQ1239605
Publication date: 1976
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/146659
11Y16: Number-theoretic algorithms; complexity
11Y05: Factorization
12-08: Computational methods for problems pertaining to field theory
Related Items
An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient, An exponent one-fifth algorithm for deterministic integer factorisation, A time-space tradeoff for Lehman’s deterministic integer factorization method, Deterministic factorization of sums and differences of powers, A search for Wieferich and Wilson primes, A Reduction of Integer Factorization to Modular Tetration, On the ultimate complexity of factorials, Smoothness and factoring polynomials over finite fields, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, A deterministic algorithm for finding \(r\)-power divisors, Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity, Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications, A deterministic algorithm for integer factorization, Faster deterministic integer factorization, A babystep-giantstep method for faster deterministic integer factorization, Few Product Gates But Many Zeros, A deterministic version of Pollard’s $p-1$ algorithm
