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.
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.
No references recorded for this publication.
No citations of this publication recorded.