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

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2000, Pages 137-145

  Grigoriev, Dima ^a   Vorobjov, Nicolai ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; VECTORS;

GROBNER BASES; ZERO DIMENSIONAL SYSTEMS;

POLYNOMIALS;

EID: 0033645901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (34)