Computing local dimension of a semialgebraic set

Authors:
Nicolai Vorobjov
Affiliations:
Dept. of Mathematical Sciences, University of Bath
Venue:
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Year:
1998

Citing 7
Cited 0

Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation
Complexity of deciding Tarski algebra

Journal of Symbolic Computation
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
Computing the complexification of a semi-algebraic set

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic

Journal of Symbolic Computation
Complexity and real computation

Complexity and real computation
Randomized and deterministic algorithms for the dimension of algebraic varieties

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract