scientific article; zbMATH DE number 3313256

From MaRDI portal

Revision as of 03:51, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5593648

Jump to:navigation, search

zbMath0196.51803MaRDI QIDQ5593648

O. B. Lupanov

Publication date: 1962

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computer science and automata

Related Items (7)

Directed monotone contact networks for threshold functions ⋮ On the Decomposition of Graphs ⋮ Better lower bounds for monotone threshold formulas ⋮ Minimal contact circuits for symmetric threshold functions ⋮ 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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5593648&oldid=30230690"