Linear solving for sign determination
- Autores
- Perrucci, Daniel Roberto
- Año de publicación
- 2011
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem, both in the univariate and multivariate setting. In particular, this enables us to improve the complexity bound for sign determination in the univariate case to O(sd2log3d), where s is the number of polynomials involved and d is a bound for their degree. Previously known complexity results involve a factor of d2.376.
Fil: Perrucci, Daniel Roberto. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina - Materia
-
Complexity
Linear Solving
Sign Determination - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/68462
Ver los metadatos del registro completo
id |
CONICETDig_fd90a8506268e63d6aff568cc2931f3a |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/68462 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Linear solving for sign determinationPerrucci, Daniel RobertoComplexityLinear SolvingSign Determinationhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem, both in the univariate and multivariate setting. In particular, this enables us to improve the complexity bound for sign determination in the univariate case to O(sd2log3d), where s is the number of polynomials involved and d is a bound for their degree. Previously known complexity results involve a factor of d2.376.Fil: Perrucci, Daniel Roberto. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; ArgentinaElsevier Science2011-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/68462Perrucci, Daniel Roberto; Linear solving for sign determination; Elsevier Science; Theoretical Computer Science; 412; 35; 8-2011; 4715-47200304-3975CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0304397511003884info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2011.05.006info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/0911.5707info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:33:19Zoai:ri.conicet.gov.ar:11336/68462instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:33:19.591CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Linear solving for sign determination |
title |
Linear solving for sign determination |
spellingShingle |
Linear solving for sign determination Perrucci, Daniel Roberto Complexity Linear Solving Sign Determination |
title_short |
Linear solving for sign determination |
title_full |
Linear solving for sign determination |
title_fullStr |
Linear solving for sign determination |
title_full_unstemmed |
Linear solving for sign determination |
title_sort |
Linear solving for sign determination |
dc.creator.none.fl_str_mv |
Perrucci, Daniel Roberto |
author |
Perrucci, Daniel Roberto |
author_facet |
Perrucci, Daniel Roberto |
author_role |
author |
dc.subject.none.fl_str_mv |
Complexity Linear Solving Sign Determination |
topic |
Complexity Linear Solving Sign Determination |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem, both in the univariate and multivariate setting. In particular, this enables us to improve the complexity bound for sign determination in the univariate case to O(sd2log3d), where s is the number of polynomials involved and d is a bound for their degree. Previously known complexity results involve a factor of d2.376. Fil: Perrucci, Daniel Roberto. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina |
description |
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem, both in the univariate and multivariate setting. In particular, this enables us to improve the complexity bound for sign determination in the univariate case to O(sd2log3d), where s is the number of polynomials involved and d is a bound for their degree. Previously known complexity results involve a factor of d2.376. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-08 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion 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://hdl.handle.net/11336/68462 Perrucci, Daniel Roberto; Linear solving for sign determination; Elsevier Science; Theoretical Computer Science; 412; 35; 8-2011; 4715-4720 0304-3975 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/68462 |
identifier_str_mv |
Perrucci, Daniel Roberto; Linear solving for sign determination; Elsevier Science; Theoretical Computer Science; 412; 35; 8-2011; 4715-4720 0304-3975 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0304397511003884 info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2011.05.006 info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/0911.5707 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier Science |
publisher.none.fl_str_mv |
Elsevier Science |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844614348051316736 |
score |
13.070432 |