Research

The complexification and degree of a semi-algebraic set


Reference:

Roy, M. F. and Vorobjov, N., 2002. The complexification and degree of a semi-algebraic set. Mathematische Zeitschrift, 239 (1), pp. 131-142.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Abstract

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).

Details

Item Type Articles
CreatorsRoy, M. F.and Vorobjov, N.
DOI10.1007/s002090100287
DepartmentsFaculty of Science > Computer Science
RefereedYes
StatusPublished
ID Code5562
Additional InformationID number: ISI:000173912600006

Export

Actions (login required)

View Item