Evaluating geometric queries using few arithmetic operations

Mostrar todas las versiones(2)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Grimson, R., Heintz, J., Kuijpers, B.
Formato: JOUR
Materias:
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
Real number
Polynomials
Trees (mathematics)
Query processing
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_09381279_v23_n3-4_p179_Grimson
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares