Artículo
Software Engineering and complexity in effective Algebraic Geometry
Fecha de publicación:
02/2013
Editorial:
Elsevier Inc
Revista:
Journal Of Complexity
ISSN:
0885-064X
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
One may represent polynomials not only by their coefficients but also by arithmetic circuits which evaluate them. This idea allowed in the past fifteen years considerable complexity progress in effective polynomial equation solving. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective Algebraic Geometry and exhibit a class of simple elimination problems which require exponential size circuits to be solved in this model. This implies that the known, circuit based elimination algorithms are already optimal.
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(OCA CIUDAD UNIVERSITARIA)
Articulos de OFICINA DE COORDINACION ADMINISTRATIVA CIUDAD UNIVERSITARIA
Articulos de OFICINA DE COORDINACION ADMINISTRATIVA CIUDAD UNIVERSITARIA
Citación
Heintz, Joos Ulrich; Kuijpers, Bart; Rojas Paredes, Andres Avelino; Software Engineering and complexity in effective Algebraic Geometry; Elsevier Inc; Journal Of Complexity; 29; 1; 2-2013; 92-138
Compartir
Altmétricas