Probabilistic computation and linear time
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
ACM SIGACT News
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
| Hi-index | 0.00 |