scientific article; zbMATH DE number 3319969

MaRDI QIDQ5600472zbMATH OpenFDO

Authors Robert L. Ashenhurst

Publication date 1959

Cited in

(21)

• Decomposable fuzzy-valued switching functions
• 1-intersecting families
• Partitive hypergraphs
• A composition for matroids
• Realizing Boolean functions on disjoint sets of variables
• Characteristic measures of switching functions
• Two representations of finite ordered sets
• Logical analysis of binary data with missing bits
• Experimental comparison of decomposition methods for systems of Boolean function
• Decomposability of partially defined Boolean functions
• A logic-based approach to incremental reasoning on multi-agent systems
• Automated inference of gene regulatory networks using explicit regulatory modules
• The complexity of modular decomposition of Boolean functions
• 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 comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
• A generalized if-then-else operator for the representation of multi-output functions
• Controllability decomposition of dynamic-algebraic Boolean control networks
• FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
• Classification functions for machine learning and data mining: recent results

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