A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
From MaRDI portal
Publication:3156163
DOI10.1108/03684920410533985zbMath1063.93002MaRDI QIDQ3156163
Anas N. Al-Rabadi, Marek A. Perkowski, Martin Zwick
Publication date: 6 January 2005
Published in: Kybernetes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03684920410533985
decomposition; Boolean functions; complex systems; complexity measures; Ashenhurst-Curtis decomposition; NPN-classification; reconstructability-analysis
68T05: Learning and adaptive systems in artificial intelligence
93B25: Algebraic methods
06E30: Boolean functions
Related Items
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