Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Intrinsic complexity estimates in polynomial optimization   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 $(s\,d)^{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.\spar \noindent We associate to each of these problems an intrinsic
system degree which becomes in worst case of order $(n\,d)^{O(n)}$ and which
measures the intrinsic complexity of the task under consideration.\spar
\noindent We design non-uniformly deterministic or uniformly probabilistic
algorithms of intrinsic, quasi-polynomial complexity which solve these
problems.

8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
25
The categories of this paper are: patt-sol
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
2
The categories of this paper are: math