Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045)
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: Bit complexity for computing one point in each connected component of a smooth real algebraic set |
scientific article; zbMATH DE number 7621046
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit complexity for computing one point in each connected component of a smooth real algebraic set |
scientific article; zbMATH DE number 7621046 |
Statements
Bit complexity for computing one point in each connected component of a smooth real algebraic set (English)
0 references
21 November 2022
0 references
real algebraic geometry
0 references
weak transversality
0 references
Noether position
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9448018
0 references
0.91599834
0 references
0.8675479
0 references
0 references
0 references
0.85590565
0 references
0.8543694
0 references
0.85389715
0 references
0.85184103
0 references
