scientific article; zbMATH DE number 3121508
From MaRDI portal
Publication:3236503
Cited in
(23)- The complexity of the realization of subdefinite matrices by gate schemes
- Optimal bounds for the approximation of Boolean functions and some applications
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- On the number of ANDs versus the number of ORs in monotone Boolean circuits
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- Cancellation-free circuits in unbounded and bounded depth
- On algorithm complexity
- Correcting closures in contact circuits
- Separating OR, SUM, and XOR circuits
- On various nonlinearity measures for Boolean functions
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Complexity of computation in finite fields
- Biclique covers and partitions
- Comparing the sizes of nondeterministic branching read-k-times programs
- Rectifier circuits of bounded depth
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- Efficient Construction of Rigid Matrices Using an NP Oracle
- Calculating optimal addition chains
- Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)
- Efficient construction of rigid matrices using an NP oracle
- Circuit depth reductions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236503)
