On the complexity of sparse elimination (Q2565194): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57908792, #quickstatements; #temporary_batch_1728305045798 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jcom.1996.0010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCOM.1996.0010 / rank | |||
Normal rank | |||
Latest revision as of 06:30, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of sparse elimination |
scientific article |
Statements
On the complexity of sparse elimination (English)
0 references
11 May 2000
0 references
The author presents a sparse resultant matrix construction and an algorithm for computing monomial bases which was defined based on mixed subdivisions. It is shown how monomial bases specify multiplication maps and allow the recovery of the coordinates of all common parts. Upper bounds on the asymptotic bit complexity of constructing monomial bases and sparse resultant matrices are given at the end.
0 references
upper bounds
0 references
sparse resultant matrix
0 references
algorithm
0 references
monomial bases
0 references
asymptotic bit complexity
0 references
