Cancellation-free circuits in unbounded and bounded depth
From MaRDI portal
Publication:2348031
DOI10.1016/j.tcs.2014.10.014zbMath1328.94110OpenAlexW1888922747MaRDI QIDQ2348031
Magnus Gausdal Find, Joan. Boyar
Publication date: 10 June 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.014
Related Items
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\), Small low-depth circuits for cryptographic applications, Arithmetic complexity of certain linear transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean function complexity. Advances and frontiers.
- Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
- Some remarks on Boolean sums
- A new lower bound on the monotone network complexity of Boolean sums
- On another Boolean matrix
- Logic minimization techniques with applications to cryptology
- Cancellation-Free Circuits in Unbounded and Bounded Depth
- Linear Circuits over $\operatorname{GF}(2)$
- A Very Compact S-Box for AES
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- On the Evaluation of Powers and Monomials
- Computational aspects of the Mobius transformation of graphs
- Communication Complexity
- Complexity of Linear Boolean Operators
- Disproving the Single Level Conjecture
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On a problem of K. Zarankiewicz
