Vikraman Arvind, Johannes Köbler, Martin Mundhenk. Lowness and the Complexity of Sparse and Tally Descriptions. In Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, editors, Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings. Volume 650 of Lecture Notes in Computer Science, pages 249-258, Springer, 1992.
@inproceedings{ArvindKM92:0,
title = {Lowness and the Complexity of Sparse and Tally Descriptions},
author = {Vikraman Arvind and Johannes Köbler and Martin Mundhenk},
year = {1992},
researchr = {https://researchr.org/publication/ArvindKM92%3A0},
cites = {0},
citedby = {0},
pages = {249-258},
booktitle = {Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings},
editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita},
volume = {650},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-56279-6},
}