"Upper Bounds for the Complexity of Sparse and Tally Descriptions."

Vikraman Arvind, Johannes Köbler, Martin Mundhenk (1996)

> Home

Details and statistics

DOI: 10.1007/BF01201814

access: closed

type: Journal Article

metadata version: 2020-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/ArvindKM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/ArvindKM96
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Upper Bounds for the Complexity of Sparse and Tally Descriptions. Math. Syst. Theory 29(1): 63-94 (1996)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.