Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
From MaRDI portal
Publication:3454754
DOI10.1145/345542.345609zbMath1326.68354MaRDI QIDQ3454754
Dima Yu. Grigoriev, Nikolaj N. jun. Vorob'ev
Publication date: 26 November 2015
Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/345542.345609
68W30: Symbolic computation and algebraic computation
Related Items
On computing absolutely irreducible components of algebraic varieties with parameters, Tensor rank: matching polynomials and Schur rings, Universal stratifications and a Bertini-type theorem, Properness defects of projection and minimal discriminant variety, On factoring parametric multivariate polynomials, Complexity of solving parametric polynomial systems, A complexity theory of constructible functions and sheaves, Solving parametric polynomial systems