Enhancements to Crisp Possibilistic Reconstructability Analysis

DOI10.1080/03081070310001638630MaRDI QIDQ4824747zbMATH OpenOpenAlexFDO

Authors Anas N. Al-Rabadi, Martin Zwick

Publication date 1 November 2004

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1040&context=sysc_fac

zbMATH Keywords

complexity measuresBoolean functionAshenhurst-Curtis decompositionreconstructibility analysismodified reconstructibility algorithm

Mathematics Subject Classification ID

Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Recommendations

• Modified reconstructability analysis for many‐valued functions and relations
• A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
• Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
• Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
• Reconstructability analysis: Aims, results, open problems

Cited in

(5)

• RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS
• Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
• A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
• Modified reconstructability analysis for many‐valued functions and relations
• scientific article; zbMATH DE number 4215793 (Why is no real title available?)

This page was built for publication: Enhancements to Crisp Possibilistic Reconstructability Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824747)