Publisher's Synopsis
Excerpt from Randomized Speed-Ups in Parallel Computation
Finding examples where randomized algorithms apparently beat the performance of their best possible deterministic counterparts is considered an interesting question in computational complexity. There are only a few examples where randomization is proven to be complexity effective. See, for instance, [ra - 83] and [mv See [ra-76] for more on this concept of randomization.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
