On additive complexity of a sequence of matrices
Igor Sergeev
TL;DR
This paper establishes new upper and lower bounds on the additive circuit complexity for implementing sequences of Boolean matrices, advancing understanding of their computational efficiency.
Contribution
It provides novel bounds for the additive complexity of Boolean matrix sequences, improving upon previous estimates.
Findings
New upper bounds for additive complexity.
New lower bounds for additive complexity.
Enhanced understanding of Boolean matrix sequence implementation.
Abstract
We show new upper and lower bounds for the complexity of implementation of a sequence of Boolean matrices proposed by Kaski et al. (arXiv:1208.0554) with additive circuits.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Graph theory and applications · Advanced Algebra and Logic