The intrinsic complexity of parametric elimination methods

Autores
Heintz, J.; Matera, G.; Pardo, L. M.; Wachenchauzer, R.
Año de publicación
1998
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This paper is devoted to the complexity analysis of a particular property, called geometric robustness owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which owns this property must necessarily have an exponential sequential time complexity even if highly performant data structures (as e.g. the straight--line program encoding of polynomials) are used. The paper finishes with the motivated introduction of a new non-uniform complexity measure for zero-dimensional polynomial equation systems, called elimination complexity.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Polynomial system solving
elimination
complexity
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/135547
Acceder
id SEDICI_31ee5b6a995d021ad7fd5245e5523909
oai_identifier_str oai:sedici.unlp.edu.ar:10915/135547
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling The intrinsic complexity of parametric elimination methodsHeintz, J.Matera, G.Pardo, L. M.Wachenchauzer, R.Ciencias InformáticasPolynomial system solvingeliminationcomplexityThis paper is devoted to the complexity analysis of a particular property, called geometric robustness owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which owns this property must necessarily have an exponential sequential time complexity even if highly performant data structures (as e.g. the straight--line program encoding of polynomials) are used. The paper finishes with the motivated introduction of a new non-uniform complexity measure for zero-dimensional polynomial equation systems, called elimination complexity.Sociedad Argentina de Informática e Investigación Operativa1998-06-26info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf37-51http://sedici.unlp.edu.ar/handle/10915/135547enginfo:eu-repo/semantics/altIdentifier/url/https://publicaciones.sadio.org.ar/index.php/EJS/article/view/134info:eu-repo/semantics/altIdentifier/issn/1514-6774info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:34:01Zoai:sedici.unlp.edu.ar:10915/135547Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:34:01.743SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv The intrinsic complexity of parametric elimination methods
title The intrinsic complexity of parametric elimination methods
spellingShingle The intrinsic complexity of parametric elimination methods
Heintz, J.
Ciencias Informáticas
Polynomial system solving
elimination
complexity
title_short The intrinsic complexity of parametric elimination methods
title_full The intrinsic complexity of parametric elimination methods
title_fullStr The intrinsic complexity of parametric elimination methods
title_full_unstemmed The intrinsic complexity of parametric elimination methods
title_sort The intrinsic complexity of parametric elimination methods
dc.creator.none.fl_str_mv Heintz, J.
Matera, G.
Pardo, L. M.
Wachenchauzer, R.
author Heintz, J.
author_facet Heintz, J.
Matera, G.
Pardo, L. M.
Wachenchauzer, R.
author_role author
author2 Matera, G.
Pardo, L. M.
Wachenchauzer, R.
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Polynomial system solving
elimination
complexity
topic Ciencias Informáticas
Polynomial system solving
elimination
complexity
dc.description.none.fl_txt_mv This paper is devoted to the complexity analysis of a particular property, called geometric robustness owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which owns this property must necessarily have an exponential sequential time complexity even if highly performant data structures (as e.g. the straight--line program encoding of polynomials) are used. The paper finishes with the motivated introduction of a new non-uniform complexity measure for zero-dimensional polynomial equation systems, called elimination complexity.
Sociedad Argentina de Informática e Investigación Operativa
description This paper is devoted to the complexity analysis of a particular property, called geometric robustness owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which owns this property must necessarily have an exponential sequential time complexity even if highly performant data structures (as e.g. the straight--line program encoding of polynomials) are used. The paper finishes with the motivated introduction of a new non-uniform complexity measure for zero-dimensional polynomial equation systems, called elimination complexity.
publishDate 1998
dc.date.none.fl_str_mv 1998-06-26
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/135547
url http://sedici.unlp.edu.ar/handle/10915/135547
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://publicaciones.sadio.org.ar/index.php/EJS/article/view/134
info:eu-repo/semantics/altIdentifier/issn/1514-6774
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
dc.format.none.fl_str_mv application/pdf
37-51
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616220415885312
score 13.070432

Publicaciones similares