Searching for "Upper Bounds for the Complexity of Sparse and Tally Descriptions." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Upper bounds for the Complexity of Sparse and Tally Descriptions
by V. Arvind, J. Köbler, M. Mundhenk — 1996 — Mathematical Systems Theory
…Upper bounds for the Complexity of Sparse and Tally Descriptions V. Arvind y Department…
Cited by 16 (8 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB