One time-travelling bit is as good as logarithmically many

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]

Authors

Ryan O'Donnell

This author has not been identified. Look up 'Ryan O'Donnell' in Google

A. C. Cem Say

This author has not been identified. Look up 'A. C. Cem Say' in Google