Deterministic factorization of sums and differences of powers

DOI10.1090/mcom/3197zbMath1414.11009arXiv1512.06401OpenAlexW2211994072MaRDI QIDQ5270841

Markus Hittmeir

Publication date: 3 July 2017

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Complexity and performance of numerical algorithms (65Y20) Factorization; primality (11A51)

Related Items (1)

A babystep-giantstep method for faster deterministic integer factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on computational complexity
• Faster deterministic integer factorization
• Faster Integer Multiplication
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator

This page was built for publication: Deterministic factorization of sums and differences of powers