Name
Abstract | ||
|---|---|---|
Constructible sets are needed in many algorithms of Computer Algebra, particularly in the Grobner Cover and other algorithms for parametric polynomial systems. In this paper we review the canonical form of constructible sets and give algorithms for computing it. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11786-016-0248-2 | Mathematics in Computer Science |
Keywords | Field | DocType |
Constructible sets, Locally closed sets, Canonical representation, Parametric polynomial system, Grobner Cover, Comprehensive Grobner system | Discrete mathematics,Combinatorics,Polynomial,Algebra,Symbolic computation,Canonical form,Parametric statistics,Mathematics | Journal |
Volume | Issue | ISSN |
10 | 1 | 1661-8270 |
Citations | PageRank | References |
1 | 0.41 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josep M. Brunat | 1 | 42 | 5.52 |
| Antonio Montes | 2 | 205 | 19.68 |