Algorithmic Number Theory

DOI10.1007/11792086MaRDI QIDQ5899249zbMATH OpenOpenAlexFDO

Authors Scott T. Parsell, Jonathan P. Sorenson

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11792086

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Analytic computations (11Y35)

Recommendations

• scientific article; zbMATH DE number 1186936
• Smooth numbers: computational number theory and beyond
• scientific article; zbMATH DE number 1996321
• scientific article; zbMATH DE number 1643952
• On powersmooth numbers

Cited in

(9)

• On powersmooth numbers
• scientific article; zbMATH DE number 1186936 (Why is no real title available?)
• scientific article; zbMATH DE number 1643952 (Why is no real title available?)
• A randomized sublinear time parallel GCD algorithm for the EREW PRAM
• scientific article; zbMATH DE number 1996321 (Why is no real title available?)
• scientific article; zbMATH DE number 2086896 (Why is no real title available?)
• Explicit estimates for the distribution of numbers free of large prime factors
• Detecting perfect powers by factoring into coprimes
• An estimate for the number of integers without large prime factors

This page was built for publication: Algorithmic Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899249)