Randomized complexity lower bounds

Simulating probabilistic by deterministic algebraic computation trees

Theoretical Computer Science

Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation

Linear decision trees: volume estimates and topological bounds

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

On randomized semi-algebraic test complexity

Journal of Complexity

Decision tree complexity and Betti numbers

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

A lower bound for randomized algebraic decision trees

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Randomized Ω(n2) lower bound for knapsack

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Nearly sharp complexity bounds for multiprocessor algebraic computations

Journal of Complexity

Complexity lower bounds for randomized computation trees over zero characteristic fields

Computational Complexity

Improved lower bound on testing membership to a polyhedron by algebraic decision trees

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Lower Bound for Randomized Linear Decision Trees Recognising a Union of Hyperplanes in a Generic Position

Lower Bound for Randomized Linear Decision Trees Recognising a Union of Hyperplanes in a Generic Position

Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees

Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees