Ryan O'Donnell, A. C. Cem Say. One time-travelling bit is as good as logarithmically many. Electronic Colloquium on Computational Complexity (ECCC), 21:91, 2014. [doi]
No references recorded for this publication.
No citations of this publication recorded.