@InProceedings{nies_et_al:LIPIcs.STACS.2018.51,
author = {Nies, Andr\'{e} and Stephan, Frank},
title = {{Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {51:1--51:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.51},
URN = {urn:nbn:de:0030-drops-84938},
doi = {10.4230/LIPIcs.STACS.2018.51},
annote = {Keywords: Computational complexity, Randomness via resource-bounded betting strategies, Martingales, Closure under permutations}
}