Asymptotic acceleration of solving multivariate polynomial systems of equations
From MaRDI portal
Publication:4542568
DOI10.1145/276698.276862zbMath1028.68216OpenAlexW1975288982MaRDI QIDQ4542568
Mourrain, Bernard, Pan, Victor Y.
Publication date: 1 August 2002
Published in: Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.418.6993
Related Items
A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Irreducible decomposition of polynomial ideals ⋮ Multivariate polynomials, duality, and structured matrices ⋮ On solving univariate sparse polynomials in logarithmic time ⋮ Solving degenerate sparse polynomial systems faster ⋮ Some speed-ups and speed limits for real algebraic geometry
Uses Software