scientific article; zbMATH DE number 3285250

zbMath0178.33202MaRDI QIDQ5567891

B. M. Kloss, Vadim A. Malyshev

Publication date: 1965

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

zbMATH Keywords

Boolean functionsbinary sequences of finite lengthKolmogorov-Ofman automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Lower bound of circuit complexity of parity function in a basis of unbounded fan-in ⋮ Models of lower-bounds proofs ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions ⋮ The complexity of the standard multiplexer function in a class of switching circuits

This page was built for publication: