Computing the canonical representation of constructible sets
Constructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets and give algorithms for computing it.
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/100350 |
| Acceso en línea: | https://hdl.handle.net/2117/100350 https://dx.doi.org/10.1007/s11786-016-0248-2 |
| Access Level: | acceso abierto |
| Palabra clave: | Constructibility (Set theory) Canonical representation Comprehensive Gröbner system Constructible sets Gröbner Cover Locally closed sets Parametric polynomial system Constructibilitat (Teoria de conjunts) Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica |
| Sumario: | Constructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets and give algorithms for computing it. |
|---|