scientific article; zbMATH DE number 3319969
From MaRDI portal
Publication:5600472
zbMath0201.48601MaRDI QIDQ5600472
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions ⋮ Two representations of finite ordered sets ⋮ Decomposability of partially defined Boolean functions ⋮ The complexity of modular decomposition of Boolean functions ⋮ Partitive hypergraphs ⋮ Controllability decomposition of dynamic-algebraic Boolean control networks ⋮ A generalized if-then-else operator for the representation of multi-output functions ⋮ FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS ⋮ Experimental comparison of decomposition methods for systems of Boolean function ⋮ A composition for matroids ⋮ Realizing Boolean functions on disjoint sets of variables ⋮ Characteristic measures of switching functions ⋮ Automated inference of gene regulatory networks using explicit regulatory modules ⋮ The path matrix and switching functions ⋮ Synthesis of contact networks from prescribed reliability functions ⋮ Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ Decomposable fuzzy-valued switching functions ⋮ 1-intersecting families ⋮ Logical analysis of binary data with missing bits
