Coin Flipping Cannot Shorten Arithmetic Computations Stasys Jukna Abstract. We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials.

First Page		Document Content
Date: 2018-04-11 14:05:21		Coin Flipping Cannot Shorten Arithmetic Computations Stasys Jukna Abstract. We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials. Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Download Document from Source Website File Size: 155,20 KB Share Document on Facebook