Algorithms for computing triangular decompositions of polynomial systems (Q5254157): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: RegularChains / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Maple / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128486174 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1104.0689 / rank | |||
Normal rank | |||
Latest revision as of 00:36, 20 April 2024
scientific article; zbMATH DE number 6443778
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for computing triangular decompositions of polynomial systems |
scientific article; zbMATH DE number 6443778 |
Statements
Algorithms for computing triangular decompositions of polynomial systems (English)
0 references
9 June 2015
0 references
incremental algorithm
0 references
polynomial system
0 references
regular chain
0 references
regular GCD
0 references
subresultant
0 references
triangular decomposition
0 references
