External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

Authors

Vikraman Arvind

This author has not been identified. Look up 'Vikraman Arvind' in Google

Johannes Köbler

This author has not been identified. Look up 'Johannes Köbler' in Google

Martin Mundhenk

This author has not been identified. Look up 'Martin Mundhenk' in Google
runs on