A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions

DOI10.1108/03684920410533985zbMath1063.93002OpenAlexW2083762490MaRDI QIDQ3156163

Marek A. Perkowski, Martin Zwick, Anas N. Al-Rabadi

Publication date: 6 January 2005

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920410533985

zbMATH Keywords

decompositionBoolean functionscomplex systemscomplexity measuresAshenhurst-Curtis decompositionNPN-classificationreconstructability-analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algebraic methods (93B25) Boolean functions (06E30)

Related Items

An overview of reconstructability analysis

Cites Work

• Unnamed Item
• Modified reconstructability analysis for many‐valued functions and relations
• Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
• A Generalized Tree Circuit
• PISTEMOLOGICAL CATEGORIES OF SYSTEMS: An Overview and Mathematical Formulation
• Generalized Tree Circuit—The Basic Building Block of an Extended Decomposition Theory