On the additive complexity of some integer sequences

DOI10.1134/s0001434624030106MaRDI QIDQ6569610

Igor S. Sergeev

Publication date: 9 July 2024

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

sumsetSidon setaddition chaincycle graphsum-free setcomplexity lower boundrectifier circuit\(\mathcal{B}_k\)-set

Mathematics Subject Classification ID

Theory of computing (68Qxx) Sequences and sets (11Bxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorems in the additive theory of numbers
• A lower bound for the length of addition chains
• A note on graphs without short even cycles
• Cycles of even length in graphs
• Approximate formulas for some functions of prime numbers
• Addition Chain Methods for the Evaluation of Specific Polynomials
• On the Evaluation of Powers and Monomials
• Computing Sequences with Addition Chains
• Rectifier Circuits of Bounded Depth
• Remarks on number theory III. On addition chains
• On addition chains

This page was built for publication: On the additive complexity of some integer sequences