The hardness of polynomial equation solving

Elimination theory was at the origin of algebraic geometry in the nineteenth century and now deals with the algorithmic solving of multivariate polynomial equation systems over the complex numbers or, more generally, over an arbitrary algebraically closed field. In this paper we investigate the intr...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Castro, D., Giusti, M., Heintz, J., Matera, G., Pardo, L.M.
Formato: JOUR
Materias:
Complexity
Continuous data structure
Elimination theory
Holomorphic and continuous encoding
Polynomial equation solving
Arithmetic circuits
Bezout number
Geometric objects
Algebra
Algorithms
Computational complexity
Data structures
Digital arithmetic
Encoding (symbols)
Geometry
Graph theory
Problem solving
Topology
Polynomials
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_16153375_v3_n4_p347_Castro
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares