Lowness and the Complexity of Sparse and Tally Descriptions

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.