A lower bound for randomized algebraic decision trees

Authors:
Dima Grigoriev;Marek Karpinski;Friedhelm Meyer auf der Heide;Roman Smolensky
Affiliations:
Dept. of Computer Science and Mathematics, Penn State University, University Park;Dept. of Computer Science, University of Bonn, 53117, Bonn;Heinz Nixdorf Institute and Computer Science Department, University of Paderborn, 33098 Paderborn;Dept. of Computer Science, University of Bonn, 53117, Bonn
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

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
Faster construction of planar two-centers

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computational geometry

ACM SIGACT News
Lower bounds for linear degeneracy testing

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum lower bounds for the collision and the element distinctness problems

Journal of the ACM (JACM)
Lower bounds for linear degeneracy testing

Journal of the ACM (JACM)
Approximate minimum spanning tree clustering in high-dimensional space

Intelligent Data Analysis

Hi-index	0.00