Fast enumeration algorithm for words with given constraints on run lengths of ones (Q764093)
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: Fast enumeration algorithm for words with given constraints on run lengths of ones |
scientific article; zbMATH DE number 6014106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast enumeration algorithm for words with given constraints on run lengths of ones |
scientific article; zbMATH DE number 6014106 |
Statements
Fast enumeration algorithm for words with given constraints on run lengths of ones (English)
0 references
13 March 2012
0 references
algorithm for enumeration and denumeration of words
0 references
constraints on run lengths
0 references
0 references
0 references
0.768768310546875
0 references
0.7521353363990784
0 references
0.7468806505203247
0 references
