An improved lower bound for finite additive 2-bases (Q503745): Difference between revisions

@@ Property / DOI @@
-.1016/j.jnt.2016.11.011
@@ Property / DOI: 10.1016/j.jnt.2016.11.011 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2428137983
@@ Property / OpenAlex ID: W2428137983 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04770
@@ Property / arXiv ID: 1606.04770 / rank @@
+Normal rank
@@ Property / cites work @@
+Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
+Normal rank
@@ Property / cites work @@
+Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications
+Normal rank
@@ Property / cites work @@
+Algorithms for Computing the h-Range of the Postage Stamp Problem
+Normal rank
@@ Property / cites work @@
+Untere Schranken für die Reichweiten von Extremalbasen fester Ordnung
+Normal rank
@@ Property / cites work @@
+A new upper bound for finite additive \(h\)-bases
@@ Property / cites work: A new upper bound for finite additive \(h\)-bases / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JNT.2016.11.011
@@ Property / DOI: 10.1016/J.JNT.2016.11.011 / rank @@
+Normal rank