A Casual Tour Around a Circuit Complexity Bound
Computational Complexity
2015-03-19 v1
Abstract
I will discuss the recent proof that the complexity class NEXP (nondeterministic exponential time) lacks nonuniform ACC circuits of polynomial size. The proof will be described from the perspective of someone trying to discover it.
Cite
@article{arxiv.1111.1261,
title = {A Casual Tour Around a Circuit Complexity Bound},
author = {Ryan Williams},
journal= {arXiv preprint arXiv:1111.1261},
year = {2015}
}
Comments
21 pages, 2 figures. An earlier version appeared in SIGACT News, September 2011