Name
Abstract | ||
|---|---|---|
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using (sd)O(n) arithmetic operations, where n and s are the numbers of variables and constraints and d is the maximal degree of the polynomials involved. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jco.2014.02.005 | Journal of Complexity |
Keywords | DocType | Volume |
Polynomial optimization,Intrinsic complexity,Degree of varieties | Journal | 30 |
Issue | ISSN | Citations |
4 | 0885-064X | 7 |
PageRank | References | Authors |
0.44 | 21 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Bank | 1 | 98 | 7.45 |
| Marc Giusti | 2 | 195 | 19.54 |
| Joos Heintz | 3 | 691 | 95.99 |
| Mohab Safey El Din | 4 | 450 | 35.64 |