Sciweavers

FOCS
1997
IEEE
13 years 9 months ago
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
Pascal Koiran