scientific article
From MaRDI portal
Publication:3236503
zbMath0072.43204MaRDI QIDQ3236503
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Separating OR, SUM, and XOR circuits ⋮ On various nonlinearity measures for Boolean functions ⋮ Comparing the sizes of nondeterministic branching read-k-times programs ⋮ Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) ⋮ The complexity of the realization of subdefinite matrices by gate schemes ⋮ Rectifier Circuits of Bounded Depth ⋮ Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs ⋮ Complexity of computation in finite fields ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Optimal bounds for the approximation of Boolean functions and some applications ⋮ Biclique covers and partitions ⋮ Calculating optimal addition chains ⋮ Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs ⋮ On algorithm complexity ⋮ A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices ⋮ Correcting closures in contact circuits ⋮ On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates ⋮ On the number of ANDs versus the number of ORs in monotone Boolean circuits ⋮ Efficient Construction of Rigid Matrices Using an NP Oracle ⋮ Cancellation-free circuits in unbounded and bounded depth
This page was built for publication:
