Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity |
scientific article; zbMATH DE number 6248931
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity |
scientific article; zbMATH DE number 6248931 |
Statements
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (English)
0 references
22 January 2014
0 references
real polynomial equation solving
0 references
intrinsic complexity
0 references
singularities
0 references
polar
0 references
copolar and bipolar varieties
0 references
degree of variety
0 references
0 references
0 references
0 references
0 references
0 references
0.9542984
0 references
0.94055223
0 references
0.88690627
0 references
0.87794954
0 references
0.8779299
0 references
0.86712295
0 references
0.86142385
0 references
0.8592408
0 references
