Evaluating geometric queries using few arithmetic operations
Let ℘ := (P1,..., Ps) be a given family of n-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by d and h, respectively. Suppose furthermore that for each 1 ≤i ≤ s the polynomial Pi can be evaluated using L arithmetic...
Guardado en:
| Publicado: |
2012
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09381279_v23_n3-4_p179_Grimson http://hdl.handle.net/20.500.12110/paper_09381279_v23_n3-4_p179_Grimson |
| Aporte de: |
| id |
paper:paper_09381279_v23_n3-4_p179_Grimson |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_09381279_v23_n3-4_p179_Grimson2023-06-08T15:53:22Z Evaluating geometric queries using few arithmetic operations Computational complexity Consistency of polynomial equation systems Constraint database Query evaluation Algebraic computations Arithmetic operations Constraint Databases Exponential numbers Geometric queries Integer coefficient Polynomial equation Polynomial equation system Query evaluation Real number Computational complexity Polynomials Trees (mathematics) Query processing Let ℘ := (P1,..., Ps) be a given family of n-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by d and h, respectively. Suppose furthermore that for each 1 ≤i ≤ s the polynomial Pi can be evaluated using L arithmetic operations (additions, subtractions, multiplications and the constants 0 and 1). Assume that the family ℘ is in a suitable sense generic. We construct a database (script D sign), supported by an algebraic computation tree, such that for each x ∈ [0, 1]n the query for the signs of P1(x),..., Ps(x) can be answered using hd(script O sign)(n2) comparisons and nL arithmetic operations between real numbers. The arithmetic-geometric tools developed for the construction of (script D sign) are then employed to exhibit example classes of systems of n polynomial equations in n unknowns whose consistency may be checked using only few arithmetic operations, admitting, however, an exponential number of comparisons. © Springer-Verlag 2012. 2012 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09381279_v23_n3-4_p179_Grimson http://hdl.handle.net/20.500.12110/paper_09381279_v23_n3-4_p179_Grimson |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Computational complexity Consistency of polynomial equation systems Constraint database Query evaluation Algebraic computations Arithmetic operations Constraint Databases Exponential numbers Geometric queries Integer coefficient Polynomial equation Polynomial equation system Query evaluation Real number Computational complexity Polynomials Trees (mathematics) Query processing |
| spellingShingle |
Computational complexity Consistency of polynomial equation systems Constraint database Query evaluation Algebraic computations Arithmetic operations Constraint Databases Exponential numbers Geometric queries Integer coefficient Polynomial equation Polynomial equation system Query evaluation Real number Computational complexity Polynomials Trees (mathematics) Query processing Evaluating geometric queries using few arithmetic operations |
| topic_facet |
Computational complexity Consistency of polynomial equation systems Constraint database Query evaluation Algebraic computations Arithmetic operations Constraint Databases Exponential numbers Geometric queries Integer coefficient Polynomial equation Polynomial equation system Query evaluation Real number Computational complexity Polynomials Trees (mathematics) Query processing |
| description |
Let ℘ := (P1,..., Ps) be a given family of n-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by d and h, respectively. Suppose furthermore that for each 1 ≤i ≤ s the polynomial Pi can be evaluated using L arithmetic operations (additions, subtractions, multiplications and the constants 0 and 1). Assume that the family ℘ is in a suitable sense generic. We construct a database (script D sign), supported by an algebraic computation tree, such that for each x ∈ [0, 1]n the query for the signs of P1(x),..., Ps(x) can be answered using hd(script O sign)(n2) comparisons and nL arithmetic operations between real numbers. The arithmetic-geometric tools developed for the construction of (script D sign) are then employed to exhibit example classes of systems of n polynomial equations in n unknowns whose consistency may be checked using only few arithmetic operations, admitting, however, an exponential number of comparisons. © Springer-Verlag 2012. |
| title |
Evaluating geometric queries using few arithmetic operations |
| title_short |
Evaluating geometric queries using few arithmetic operations |
| title_full |
Evaluating geometric queries using few arithmetic operations |
| title_fullStr |
Evaluating geometric queries using few arithmetic operations |
| title_full_unstemmed |
Evaluating geometric queries using few arithmetic operations |
| title_sort |
evaluating geometric queries using few arithmetic operations |
| publishDate |
2012 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09381279_v23_n3-4_p179_Grimson http://hdl.handle.net/20.500.12110/paper_09381279_v23_n3-4_p179_Grimson |
| _version_ |
1768543618143879168 |