The complexity of semilinear problems in succinct representation (Q862341)
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: The complexity of semilinear problems in succinct representation |
scientific article; zbMATH DE number 5118075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of semilinear problems in succinct representation |
scientific article; zbMATH DE number 5118075 |
Statements
The complexity of semilinear problems in succinct representation (English)
0 references
24 January 2007
0 references
BSS additive model
0 references
semilinear sets
0 references
complete problems
0 references
0 references
0.91860783
0 references
0.9131738
0 references
0.8880015
0 references
0.87715775
0 references
0.8730998
0 references
