On the time-space complexity of geometric elimination procedures

In [25] and [22] a new algorithmic concept was introduced for the symbolic solution of a zero dimensional complete intersection polynomial equation system satisfying a certain generic smoothness condition. The main innovative point of this algorithmic concept consists in the introduction of a new ge...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Matera, Guillermo
Publicado: 2001
Materias:
Algebraic complexity theory
Algorithmic elimination theory
Computation tree
Polynomial equation solving
Straight-line program
Symbolic computation
Time-space complexity
Algorithms
Computational complexity
Mathematical models
Mathematical programming
Matrix algebra
Polynomials
Theorem proving
Trees (mathematics)
Geometric elimination procedures
Straight line program
Time space complexity
Geometry
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09381279_v11_n4_p239_Heintz
http://hdl.handle.net/20.500.12110/paper_09381279_v11_n4_p239_Heintz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares