Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231)
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: Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences |
scientific article; zbMATH DE number 7870682
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences |
scientific article; zbMATH DE number 7870682 |
Statements
Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (English)
0 references
25 June 2024
0 references
unconstrained binary polynomial program
0 references
dynamic programming
0 references
low autocorrelated binary sequences
0 references
0 references
0 references
0 references
0 references
