The complexification and degree of a semi-algebraic set

M F Roy, N Vorobjov

Research output: Contribution to journalArticlepeer-review

12 Citations (SciVal)


The complexification of a semi-algebraic set S subset of R-n is the smallest complex algebraic set containing S. Let S be defined by 8 polynomials of degrees less than d. We prove that the geometric degree of the complexification is less than s(n)O(d)(2n).
Original languageEnglish
Pages (from-to)131-142
Number of pages12
JournalMathematische Zeitschrift
Issue number1
Publication statusPublished - 2002


Dive into the research topics of 'The complexification and degree of a semi-algebraic set'. Together they form a unique fingerprint.

Cite this