scientific article; zbMATH DE number 3313256

MaRDI QIDQ5593648zbMATH OpenFDO

Authors O. B. Lupanov

Publication date 1962

zbMATH Keywords

computer science and automata

Cited in

(7)

• 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
• Decompositions of functions based on arity gap

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 Q5593648)