T. Aaron Gulliver, Ulrich Speidel. On the ratio between the maximal T-complexity and the T-complexity of random strings. In Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012. pages 498-500, IEEE, 2012. [doi]
@inproceedings{GulliverS12,
title = {On the ratio between the maximal T-complexity and the T-complexity of random strings},
author = {T. Aaron Gulliver and Ulrich Speidel},
year = {2012},
url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6400985},
researchr = {https://researchr.org/publication/GulliverS12},
cites = {0},
citedby = {0},
pages = {498-500},
booktitle = {Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012},
publisher = {IEEE},
isbn = {978-1-4673-2521-9},
}