Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric |
scientific article |
Statements
Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (English)
0 references
21 February 2019
0 references
sparse polynomials
0 references
BKK bound
0 references
Newton iteration
0 references
toric varieties
0 references
momentum map
0 references
homotopy algorithms
0 references
0 references
0 references
0 references
0.8751577138900757
0 references
0.8347273468971252
0 references
0.8344029784202576
0 references
0.8156720399856567
0 references
0.8156654834747314
0 references
