On the complexity of the multivariate resultant

DOI10.1016/j.jco.2012.10.001zbMath1260.14074arXiv1210.1451OpenAlexW3122659810MaRDI QIDQ1939330

Natacha Portier, Pascal Koiran, Bruno Grenet

Publication date: 4 March 2013

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1451

zbMATH Keywords

determinantmultivariate resultantpolynomial system solvingcomplexity lower boundsimplicit representations

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Solving polynomial systems; resultants (13P15)

Related Items (5)

Complexity of constructing Dixon resultant matrix ⋮ Processing succinct matrices and vectors ⋮ Sparse resultants and straight-line programs ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ The characteristic polynomial of the complete 3-uniform hypergraph

This page was built for publication: On the complexity of the multivariate resultant