On the additive complexity of some integer sequences

DOI10.1134/S0001434624030106MaRDI QIDQ6569610zbMATH OpenFDO

Authors I. S. Sergeev

Publication date 9 July 2024

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434624030106

zbMATH Keywords

\(\mathcal{B}_k\)-setaddition chaincomplexity lower boundcycle graphrectifier circuitSidon setsum-free setsumset

Mathematics Subject Classification ID

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

Cites work

• A lower bound for the length of addition chains
• A note on graphs without short even cycles
• Addition Chain Methods for the Evaluation of Specific Polynomials
• Approximate formulas for some functions of prime numbers
• Computing Sequences with Addition Chains
• Cycles of even length in graphs
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• scientific article; zbMATH DE number 3251434 (Why is no real title available?)
• scientific article; zbMATH DE number 3091928 (Why is no real title available?)
• On addition chains
• On the Evaluation of Powers and Monomials
• Rectifier circuits of bounded depth
• Remarks on number theory III. On addition chains
• Theorems in the additive theory of numbers

Cited in

(1)

• Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569610)