On one problem of searching for tuples of fragments in a numerical sequence (Q3115185)
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: On one problem of searching for tuples of fragments in a numerical sequence |
scientific article; zbMATH DE number 6007827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On one problem of searching for tuples of fragments in a numerical sequence |
scientific article; zbMATH DE number 6007827 |
Statements
20 February 2012
0 references
discrete optimization problem
0 references
numerical sequence
0 references
recurring tuple of fragments
0 references
off-line algorithm
0 references
0.8813268542289734
0 references
0.8086234927177429
0 references
0.799677848815918
0 references
0.7989271879196167
0 references
