Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Lower bounds for linear decision trees via an energy complexity argument
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Hi-index | 0.00 |