Counting connected components of a semialgebraic set in subexponential time
type: Item
instance of: scholarly article
title: Counting connected components of a semialgebraic set in subexponential time
zbMATH Open document ID: 0900.68253
DOI: 10.1007/BF01202001
author: Nicolai Vorobjov
author: Dima Grigoriev
published in: Computational Complexity
publication date: 1993-04-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 149536
MaRDI profile type: Publication
cites work: The complexity of elementary algebra and geometry
cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness
cites work: Q4079605
cites work: Q5643279
cites work: Complexity of deciding Tarski algebra
cites work: Solving systems of polynomial inequalities in subexponential time
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
cites work: Q4771357
cites work: Q5807665
description: scientific article; zbMATH DE number 149536