An improved lower bound for finite additive 2-bases (Q503745): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for Computing the h-Range of the Postage Stamp Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Untere Schranken für die Reichweiten von Extremalbasen fester Ordnung / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new upper bound for finite additive \(h\)-bases / rank | |||
Normal rank |
Latest revision as of 07:32, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved lower bound for finite additive 2-bases |
scientific article |
Statements
An improved lower bound for finite additive 2-bases (English)
0 references
23 January 2017
0 references
finite additive basis
0 references
lower bound
0 references
0 references