Straight-line programs in geometric elimination theory (Q1380007)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Straight-line programs in geometric elimination theory
scientific article

    Statements

    Straight-line programs in geometric elimination theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2000
    0 references
    This paper provides the full proofs for \textit{M. Giusti, J. Heintz, J. E. Morais} and \textit{L. M. Pardo} [Lect. Notes Comput. Sci. 948, 205-231 (1995; Zbl 0902.12005)]. In comparison with the latter it is expanded in particular what concerns the compression of straight line programs; along many pages however it runs almost word for word as in the cited preliminary conference version.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial system solving
    0 references
    elimination
    0 references
    geometric degree
    0 references
    arithmetic networks
    0 references
    encoding polynomials by straight-line programs
    0 references
    complexity
    0 references
    greatest common divisor of univariate polynomials
    0 references
    primitive element constructions
    0 references
    shape lemmas
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references