Software Design and Complexity in Effective Algebraic Geometry

dc.creatorRojas Paredes, Andrés
dc.date2011-08
dc.date2011
dc.date2022-09-19T15:50:57Z
dc.date.accessioned2023-07-15T08:10:19Z
dc.date.available2023-07-15T08:10:19Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/142318
dc.identifierhttps://40jaiio.sadio.org.ar/sites/default/files/T2011/EST/TrabFinales/704.pdf
dc.identifierissn:1850-2946
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7483300
dc.descriptionWe introduce a new, software architecture based computation model for Scientific Computing. Its relevance becomes illustrated by the precise formulation and solution of a more than thirty years open complexity problem in Effective Algebraic Geometry (elimination theory).
dc.descriptionSociedad Argentina de Informática e Investigación Operativa
dc.formatapplication/pdf
dc.format242-263
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Informáticas
dc.subjectSoftware
dc.subjectDesign
dc.subjectAlgebraic Geometry
dc.titleSoftware Design and Complexity in Effective Algebraic Geometry
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución