Q3980333
type: Item
instance of: scholarly article
zbMATH Open document ID: 0801.68097
publication date: 1992-06-26T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 14P10
Mathematics Subject Classification ID: 14Q99
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 03C60
zbMATH DE Number: 21309
zbMATH Keywords: fast algorithm
zbMATH Keywords: number of connected components
zbMATH Keywords: semialgebraic set
zbMATH Keywords: first order theory of real closed fields
author: Nicolai Vorobjov
author: Dima Grigoriev
MaRDI profile type: Publication
Recommended article: Q3364033
Recommended article: Finding connected components of a semialgebraic set in subexponential time
Recommended article: Q3971133
Recommended article: Description of the connected components of a semialgebraic set in single exponential time
Recommended article: Q3983701
Recommended article: Q4232468
Recommended article: Estimating the number of connected components in sublinear time
Recommended article: Complexity of finding irreducible components of a semialgebraic set
Recommended article: Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity
description: scientific article; zbMATH DE number 21309