Coin Flipping Cannot Shorten Arithmetic Computations
暂无分享，去创建一个
Abstract We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials.
[1] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[2] Marek Karpinski,et al. On real Turing machines that toss coins , 1995, STOC '95.
[3] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .