A low complexity probabilistic test for integer multiplication

DOI10.1016/j.jco.2009.12.002zbMath1196.68104OpenAlexW2048881613MaRDI QIDQ983183

Gérald Tenenbaum, Dima Yu. Grigoriev

Publication date: 3 August 2010

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2009.12.002

zbMATH Keywords

small divisorsinteger multiplicationprobabilistic test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Counting irreducible binomials over finite fields

Cites Work

• Fast multiplication of large numbers
• LOCAL DENSITIES OVER INTEGERS FREE OF LARGE PRIME FACTORS
• Designing programs that check their work
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A low complexity probabilistic test for integer multiplication