On the Bit Complexity of Solving Bilinear Polynomial Systems

DOI10.1145/2930889.2930919zbMath1360.13066DBLPconf/issac/EmirisMT16OpenAlexW2503997773WikidataQ57908658 ScholiaQ57908658MaRDI QIDQ2985830

Elias P. Tsigaridas, Angelos Mantzaflaris, Ioannis Z. Emiris

Publication date: 10 May 2017

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

Full work available at URL: https://hal.inria.fr/hal-01401134/file/bilinear.pdf

zbMATH Keywords

polynomial system solvingresultant matrixseparation boundsDMMbilinear polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05) Solving polynomial systems; resultants (13P15)

Related Items (3)

Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems ⋮ Multilinear polynomial systems: root isolation and bit complexity

This page was built for publication: On the Bit Complexity of Solving Bilinear Polynomial Systems