Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A numerical algorithm for zero counting, I: Complexity and accuracy
Journal of Complexity
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Two logical hierarchies of optimization problems over the real numbers
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |