Journal of Combinatorial Theory Series A
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
| Hi-index | 0.00 |
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our generalization, the underlying group need not be abelian so long as the generating set is a union of conjugacy classes.