Fast rational function reconstruction

DOI10.1145/1145768.1145801zbMath1356.11094OpenAlexW2002451809MaRDI QIDQ2958986

Sara Khodadad, Michael B. Monagan

Publication date: 3 February 2017

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

Full work available at URL: http://summit.sfu.ca/item/10240

zbMATH Keywords

rational reconstructionmodular algorithmsfast Euclidean algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Sparse interpolation of multivariate rational functions ⋮ Reconstructing rational functions with \texttt{FireFly} ⋮ An interpolation algorithm for computing Dixon resultants

Uses Software

• ffmodstd

This page was built for publication: Fast rational function reconstruction