Sparse Rational Univariate Representation

DOI10.1145/3087604.3087653zbMath1458.68285OpenAlexW2618948979MaRDI QIDQ5119954

Éric Schost, Angelos Mantzaflaris, Elias P. Tsigaridas

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01528377/file/srur.pdf

zbMATH Keywords

rational univariate representationpolynomial systemsparse resultantseparation boundDMM

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items (6)

Computing the topology of a plane or space hyperelliptic curve ⋮ Subresultants and the Shape Lemma ⋮ On Isolating Roots in a Multiple Field Extension ⋮ Segre-driven radicality testing ⋮ Spectral norm of a symmetric tensor and its computation ⋮ Multilinear polynomial systems: root isolation and bit complexity

This page was built for publication: Sparse Rational Univariate Representation