The complexity of searching in \(X+Y\) and other multisets (Q911276)
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:911276 |
scientific article; zbMATH DE number 4141493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of searching in \(X+Y\) and other multisets |
scientific article; zbMATH DE number 4141493 |
Statements
The complexity of searching in \(X+Y\) and other multisets (English)
0 references
1990
0 references
sorted matrices
0 references
searching in partial ordered sets
0 references
complexity of searching
0 references
0.7838122248649597
0 references
0.7820944786071777
0 references
0.7757086753845215
0 references
0.7675378322601318
0 references
0.7612476944923401
0 references
