scientific article; zbMATH DE number 3248024
From MaRDI portal
Publication:5534931
zbMath0154.25903MaRDI QIDQ5534931
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Depth and polynomial equivalence of formulas for closed classes of two- valued logic ⋮ On almost bad Boolean bases ⋮ On some series of bases for the set of Boolean functions ⋮ Parallelizable algebras ⋮ Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits ⋮ Circuit complexity of linear functions: gate elimination and feeble security ⋮ Iterated Boolean functions in the elementary basis ⋮ The complexity of the realization of symmetrical functions by formulae ⋮ Read-once functions of the algebra of logic in pre-elementary bases ⋮ A new proof of Stetsenko's theorem ⋮ On an infinite sequence of improving Boolean bases ⋮ Characteristic measures of switching functions ⋮ The length of a read-many certificate in the basis of all functions of \(l\) variables
This page was built for publication:
