Half-GCD and fast rational recovery

DOI10.1145/1073884.1073917MaRDI QIDQ5262768zbMATH OpenOpenAlexFDO

Authors Daniel A. Lichtblau

Publication date 16 July 2015

Published in Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1073884.1073917

zbMATH Keywords

integer GCDrational recoverysubquadratic arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic systems of matrices (15A30)

Recommendations

• Fast rational function reconstruction
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Efficient rational number reconstruction
• Vector rational number reconstruction
• Acceleration of Euclidean algorithm and extensions

Cited in

(5)

• Jebelean-Weber's algorithm without spurious factors
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Acceleration of Euclidean algorithm and extensions
• Binomiality testing and computing sparse polynomials via witness sets
• Robust HGCD with no backup steps

This page was built for publication: Half-GCD and fast rational recovery

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