Algorithmic Number Theory

DOI10.1007/11792086zbMATH Open1143.11366OpenAlexW2977481208MaRDI QIDQ5899249FDOQ5899249

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• On powersmooth numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• A randomized sublinear time parallel GCD algorithm for the EREW PRAM
• Title not available (Why is that?)
• Title not available (Why is that?)
• Detecting perfect powers by factoring into coprimes
• Explicit estimates for the distribution of numbers free of large prime factors
• 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)