Efficiently certifying non-integer powers

DOI10.1007/s00037-010-0297-xzbMath1276.11202DBLPjournals/cc/KaltofenL10OpenAlexW2081759095WikidataQ57439075 ScholiaQ57439075MaRDI QIDQ626685

Mark Lavin, Erich L. Kaltofen

Publication date: 18 February 2011

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

Full work available at URL: https://doi.org/10.1007/s00037-010-0297-x

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Density theorems (11R45) Factorization (11Y05)

This page was built for publication: Efficiently certifying non-integer powers