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
id todo:paper_03784754_v42_n4-6_p429_Solerno
record_format dspace
spelling todo:paper_03784754_v42_n4-6_p429_Solerno2023-10-03T15:33:06Z Complexity bounds in elimination theory - A survey Solernó, P. Algebraic variety Complexity Straight line program Algebra Algorithms Mathematical models Polynomials Problem solving Topology Algebraic variety Arithmetic intersection theory Complexity bounds Duality theory Elimination theory Straight line program Computational complexity 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 bounds results - as much progress as they may represent - seem not to solve satisfactorily the basic problems we are considering. On the other hand we shall also show how both the improvement of general algorithms and the research of lower bounds are related to certain mathematical tools as duality theory or arithmetic intersection theory. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03784754_v42_n4-6_p429_Solerno
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Algebraic variety
Complexity
Straight line program
Algebra
Algorithms
Mathematical models
Polynomials
Problem solving
Topology
Algebraic variety
Arithmetic intersection theory
Complexity bounds
Duality theory
Elimination theory
Straight line program
Computational complexity
spellingShingle Algebraic variety
Complexity
Straight line program
Algebra
Algorithms
Mathematical models
Polynomials
Problem solving
Topology
Algebraic variety
Arithmetic intersection theory
Complexity bounds
Duality theory
Elimination theory
Straight line program
Computational complexity
Solernó, P.
Complexity bounds in elimination theory - A survey
topic_facet Algebraic variety
Complexity
Straight line program
Algebra
Algorithms
Mathematical models
Polynomials
Problem solving
Topology
Algebraic variety
Arithmetic intersection theory
Complexity bounds
Duality theory
Elimination theory
Straight line program
Computational complexity
description 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 bounds results - as much progress as they may represent - seem not to solve satisfactorily the basic problems we are considering. On the other hand we shall also show how both the improvement of general algorithms and the research of lower bounds are related to certain mathematical tools as duality theory or arithmetic intersection theory.
format JOUR
author Solernó, P.
author_facet Solernó, P.
author_sort Solernó, P.
title Complexity bounds in elimination theory - A survey
title_short Complexity bounds in elimination theory - A survey
title_full Complexity bounds in elimination theory - A survey
title_fullStr Complexity bounds in elimination theory - A survey
title_full_unstemmed Complexity bounds in elimination theory - A survey
title_sort complexity bounds in elimination theory - a survey
url http://hdl.handle.net/20.500.12110/paper_03784754_v42_n4-6_p429_Solerno
work_keys_str_mv AT solernop complexityboundsineliminationtheoryasurvey
_version_ 1782028385503936512

Ejemplares similares