Vikraman Arvind, Johannes Köbler, Martin Mundhenk. Upper Bounds for the Complexity of Sparse and Tally Descriptions. Theory Comput. Syst., 29(1):63-94, 1996.
@article{ArvindKM96:0,
title = {Upper Bounds for the Complexity of Sparse and Tally Descriptions},
author = {Vikraman Arvind and Johannes Köbler and Martin Mundhenk},
year = {1996},
researchr = {https://researchr.org/publication/ArvindKM96%3A0},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {29},
number = {1},
pages = {63-94},
}