On the complexity of solving bivariate systems

DOI10.1145/2465506.2465950zbMath1360.68941OpenAlexW2133779997MaRDI QIDQ2963241

Esmaeil Mehrabi, Romain Lebreton, É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

complexitybivariate polynomial systems

Mathematics Subject Classification ID

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

Related Items (6)

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Uniform Determinantal Representations ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals

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