A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases (Q2877897)
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: A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases |
scientific article; zbMATH DE number 6335157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases |
scientific article; zbMATH DE number 6335157 |
Statements
28 August 2014
0 references
additive basis
0 references
restricted basis
0 references
math.NT
0 references
math.CO
0 references
A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases (English)
0 references
0.7796064615249634
0 references
0.7750404477119446
0 references
0.7650612592697144
0 references
