Lower bounds for solving linear diophantine equations on random access machines
Journal of the ACM (JACM)
Simulating probabilistic by deterministic algebraic computation trees
Theoretical Computer Science
Randomness, provability, and the separation of Monte Carlo time and space
Computation theory and logic
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. A)
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 note on Rabin's width of a complete proof
Computational Complexity
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh 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
An exponential lower bound on the size of algebraic decision trees for max
Computational Complexity
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
Border Rank of a pxqx2 Tensor and the Optimal Approximation od a Pair of Bilinear Forms
Proceedings of the 7th Colloquium on Automata, Languages and Programming
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 Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees
Randomized complexity lower bounds
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
| Hi-index | 0.00 |