Linear solving for sign determination | ||
| dc.conicet.fuente | individual | |
| dc.conicet.organizacion | Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria | |
| dc.conicet.paisOrganizacion | Argentina | |
| dc.conicet.paisOrganizacion | Argentina | |
| dc.conicet.produccionid | 4456870 | |
| dc.contributor.author | Perrucci, Daniel Roberto | |
| dc.date.accessioned | 2019-01-23T18:43:52Z | |
| dc.date.available | 2019-01-23T18:43:52Z | |
| dc.date.issued | 2011-08 | |
| dc.date.updated | 2019-01-17T13:59:07Z | |
| dc.description.abstract | 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. | es |
| dc.description.fil | 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 | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Perrucci, Daniel Roberto; Linear solving for sign determination; Elsevier Science; Theoretical Computer Science; 412; 35; 8-2011; 4715-4720 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0304-3975 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/68462 | |
| dc.journal.ciudad | Amsterdam | es |
| dc.journal.number | 35 | es |
| dc.journal.pagination | 4715-4720 | es |
| dc.journal.pais | Países Bajos | es |
| dc.journal.title | Theoretical Computer Science | es |
| dc.journal.volume | 412 | es |
| dc.language.iso | eng | es |
| dc.publisher | Elsevier Science | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0304397511003884 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1016/j.tcs.2011.05.006 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/0911.5707 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ | * |
| dc.subject | Complexity | es |
| dc.subject | Linear Solving | es |
| dc.subject | Sign Determination | es |
| dc.subject.classification | Matemática Pura | es |
| dc.subject.classification | Matemáticas | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Linear solving for sign determination | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.d509f8ed-eded-4fc6-86b2-0c588e3c0c7e_L.pdf
- Tamaño:
- 218.8 KB
- Formato:
- Adobe Portable Document Format
- Descripción: