Vector rational number reconstruction

DOI10.1145/1993886.1993900MaRDI QIDQ5254153zbMATH OpenOpenAlexFDO

Authors Curtis Bright, Arne Storjohann

Publication date 9 June 2015

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

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

zbMATH Keywords

lattice basis reductionrational reconstruction

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient rational number reconstruction
• On Rational Number Reconstruction and Approximation
• Rational approximation vectors
• Fast rational function reconstruction
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Fault-tolerant modular reconstruction of rational numbers
• scientific article; zbMATH DE number 1643932
• Publication:4889138
• Realizations of matrices of rational numbers
• scientific article; zbMATH DE number 4196073

Cited in

(8)

• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• Fault-tolerant modular reconstruction of rational numbers
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• scientific article; zbMATH DE number 1643932 (Why is no real title available?)
• On Rational Number Reconstruction and Approximation
• Maximal quotient rational reconstruction
• Half-GCD and fast rational recovery
• Some applications of Chinese remainder theorem codes with error-correction

Describes a project that uses

Uses Software

• LinBox

This page was built for publication: Vector rational number reconstruction

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