On the complexity of solving bivariate systems

DOI10.1145/2465506.2465950MaRDI QIDQ2963241zbMATH OpenOpenAlexFDO

Authors Romain Lebreton, Esmaeil Mehrabi, Éric Schost

Publication date 10 February 2017

Published in Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

bivariate polynomial systemscomplexity

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(11)

• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Solving bivariate systems using rational univariate representations
• Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
• Uniform Determinantal Representations
• p-adic algorithm for bivariate Gröbner bases
• Elimination ideal and bivariate resultant over finite fields
• On the complexity of solving generic overdetermined bilinear systems
• Bivariate polynomial reduction and elimination ideal over finite fields
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases

This page was built for publication: On the complexity of solving bivariate systems

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