On the computational complexity of polynomials and bilinear mappings

Authors:
J. Heintz
Affiliations:
-
Venue:
Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1987

Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Fast computation of discrete invariants associated to a differential rational mapping

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Polynomial equation solving by lifting procedures for ramified fibers

Theoretical Computer Science - Algebraic and numerical algorithm

Hi-index	0.00