Lower bounds on testing membership to a polyhedron by algebraic decision trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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 |