Publication:5593648
From MaRDI portal
zbMath0196.51803MaRDI QIDQ5593648
Publication date: 1962
Related Items
Decompositions of functions based on arity gap, The network complexity and the Turing machine complexity of finite functions, An information-theoretic method in combinatorial theory, Directed monotone contact networks for threshold functions, Better lower bounds for monotone threshold formulas, Minimal contact circuits for symmetric threshold functions, On the Decomposition of Graphs