Complexity bounds in elimination theory - A survey

This paper is devoted to some last algorithmic progress in classical elimination theory from the complexity point of view. These results will be presented as a short survey (without proofs) treating essentially upper and lower bounds problems. The first aim of this paper is to show that the upper bo...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Solernó, P.
Formato: JOUR
Materias:
Algebraic variety
Complexity
Straight line program
Algebra
Algorithms
Mathematical models
Polynomials
Problem solving
Topology
Arithmetic intersection theory
Complexity bounds
Duality theory
Elimination theory
Computational complexity
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03784754_v42_n4-6_p429_Solerno
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares