Publication:3236503
From MaRDI portal
zbMath0072.43204MaRDI QIDQ3236503
Publication date: 1956
Related Items
Comparing the sizes of nondeterministic branching read-k-times programs, The complexity of the realization of subdefinite matrices by gate schemes, Optimal bounds for the approximation of Boolean functions and some applications, 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, Correcting closures in contact circuits