Bounds on numers of vectors of multiplicities for polynomials which are easy to compute

DOI10.1145/345542.345609zbMath1326.68354OpenAlexW2048019015MaRDI 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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (8)

Tensor rank: matching polynomials and Schur rings ⋮ On factoring parametric multivariate polynomials ⋮ Solving parametric polynomial systems ⋮ Complexity of solving parametric polynomial systems ⋮ Universal stratifications and a Bertini-type theorem ⋮ Properness defects of projection and minimal discriminant variety ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ A complexity theory of constructible functions and sheaves

This page was built for publication: Bounds on numers of vectors of multiplicities for polynomials which are easy to compute