A convex geometric approach to counting the roots of a polynomial system (Q1338221)
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: A convex geometric approach to counting the roots of a polynomial system |
scientific article; zbMATH DE number 695896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A convex geometric approach to counting the roots of a polynomial system |
scientific article; zbMATH DE number 695896 |
Statements
A convex geometric approach to counting the roots of a polynomial system (English)
0 references
14 May 1995
0 references
polynomial system
0 references
complex coefficients
0 references
number of isolated roots
0 references
Bézout's theorem
0 references
upper bound
0 references
computational complexity
0 references
root counting
0 references
0 references
0 references
0.91935885
0 references
0.8958597
0 references
0.89573246
0 references
0.8925776
0 references
0.89221525
0 references
0.8827713
0 references
0.8823877
0 references
0.88124037
0 references
