Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design (Q990937)
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: Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design |
scientific article; zbMATH DE number 5777498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design |
scientific article; zbMATH DE number 5777498 |
Statements
Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design (English)
0 references
1 September 2010
0 references
computational complexity
0 references
spaced seeds
0 references
Golomb ruler
0 references
0.8488842248916626
0 references
0.8302007913589478
0 references
0.8273119330406189
0 references
0.8146488070487976
0 references
0.7957802414894104
0 references
