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]
@article{ODonnellS14,
title = {One time-travelling bit is as good as logarithmically many},
author = {Ryan O'Donnell and A. C. Cem Say},
year = {2014},
url = {http://eccc.hpi-web.de/report/2014/091},
researchr = {https://researchr.org/publication/ODonnellS14},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {21},
pages = {91},
}