On the Complexity of One System of Linear Boolean Functions
The complexity of computing systems of linear Boolean functions by circuits in the linear basis $$\{\oplus\}$$ is considered. A tight value of the complexity of the system of linear Boolean functions with a coefficient matrix coinciding with a Hadamard matrix is established.
Authors
- Александр Викторович Чашкин
Institutions
- Lomonosov Moscow State University (RU)
Publication Details
- Journal
- Moscow University Mathematics Bulletin
- Published
- 2025-04-01
- DOI
- https://doi.org/10.3103/s0027132225700329
- Primary Topic
- Commutative Algebra and Its Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00