A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Derandomized graph products
1995
Computational Complexity
Berman and Schnitger [10] gave a randomized reduction from approximating within constant factors arbitrarily close to 1 to approximating clique within a factor of n (for some ). This reduction was further studied by Blum [11], who gave it the name randomized graph products. We show that this reduction can be made deterministic (derandomized), using random walks on expander graphs [1]. The main technical contribution of this paper is in lower bounding the probability that all steps of a random
doi:10.1007/bf01277956
fatcat:xjuibrzzv5eznh5braolfndyki