Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Topological complexity of zero finding with algebraic operations
Journal of Complexity
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
Linear Transformations in Boolean Complexity Theory
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Faster real feasibility via circuit discriminants
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Combinatorics for computing relativistic several complex variable domains
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |