Upper bounds for the complexity of sparse and tally descriptions (Q4864446)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4864446 |
scientific article; zbMATH DE number 845887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for the complexity of sparse and tally descriptions |
scientific article; zbMATH DE number 845887 |
Statements
Upper bounds for the complexity of sparse and tally descriptions (English)
0 references
20 February 1996
0 references
structural complexity theory
0 references
sparse sets
0 references
0.8541896343231201
0 references
0.8434581756591797
0 references
0.8415828347206116
0 references
0.7954516410827637
0 references
