Description of the connected components of a semialgebraic set in single exponential time
This paper is devoted to the following result: let R be a real closed field and let S be a semialgebraic subset of Rn defined by a boolean combination of polynomial inequalities. Let D be the sum of the degrees of the polynomials involved. Then it is possible to find algorithmically a description of...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | Artículo publishedVersion |
Publicado: |
1994
|
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01795376_v11_n1_p121_Heintz http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_01795376_v11_n1_p121_Heintz_oai |
Aporte de: |
Sumario: | This paper is devoted to the following result: let R be a real closed field and let S be a semialgebraic subset of Rn defined by a boolean combination of polynomial inequalities. Let D be the sum of the degrees of the polynomials involved. Then it is possible to find algorithmically a description of the semialgebraically connected components of S in sequential time Dn o(1) and parallel time (n log D)o(1) This implies that the problem of finding the connected components of a semialgebraic set can be solved in P-SPACE. © 1994 Springer-Verlag New York Inc. |
---|