On relative OR-complexity of Boolean matrices and their complements
Igor S. Sergeev
TL;DR
This paper constructs explicit Boolean matrices demonstrating a significant difference in rectifier complexity between the matrices and their complements, highlighting new insights into the complexity of Boolean matrix representations.
Contribution
It introduces explicit Boolean matrices with notably different OR-complexity from their complements, advancing understanding of Boolean matrix complexity.
Findings
Explicit matrices with large complexity gap
Significant difference in OR-complexity between matrices and complements
New methods for analyzing Boolean matrix complexity
Abstract
We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices.
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 · Coding theory and cryptography · Advanced Algebra and Logic