11 citations · 47 across the 48 of their papers we have counts for
Showing 2008 · math.AGShow all
2 papers · 2 filters
math.AG2008
Notes on algebra and geometry of polynomial representations
Gennadiy Averkov
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m…
math.AG2008★ 6 cited
Representing elementary semi-algebraic sets by a few polynomial inequalities: A constructive approach
Gennadiy Averkov
Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case…