Complexity of cylindrical decompositions of sub-Pfaffian (Q5951564)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1686166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of cylindrical decompositions of sub-Pfaffian |
scientific article; zbMATH DE number 1686166 |
Statements
Complexity of cylindrical decompositions of sub-Pfaffian (English)
0 references
10 October 2002
0 references
The authors give an algorithm for obtaining cylindrical cell decompositions of sub-Pfaffian sets whose complexity bound is doubly exponential in \(n^3\), \(n\) being the dimension of the ambient affine space.
0 references
algorithm
0 references
cylindrical cell decompositions
0 references
sub-Pfaffian sets
0 references
0 references
0.8670251369476318
0 references
0.8507217168807983
0 references
0.822792649269104
0 references
0.7823387980461121
0 references
