Decomposition of Boolean relations and functions in logic synthesis and data analysis

DOI10.1007/3-540-45554-X_60MaRDI QIDQ4709311zbMATH OpenFDO

Authors Piotr Sapiecha, Hemapriya Selvaraj, M. Pleban

Publication date 20 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2005/20050487.htm

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Decomposition of Boolean functions
• A decomposition of Boolean functions
• Decomposition of Boolean functions applying the apparatus of Boolean derivatives
• scientific article; zbMATH DE number 512939
• The Decomposition Tree for analyses of Boolean functions
• scientific article; zbMATH DE number 597624
• Methods for decomposition of Boolean functions: algorithms, quality indices, and applications
• Decomposition of multi-output Boolean functions
• Logical analysis of data with decomposable structures

Cited in

(5)

• Experimental comparison of decomposition methods for systems of Boolean function
• Decomposability of partially defined Boolean functions
• scientific article; zbMATH DE number 1436990 (Why is no real title available?)
• BDD-based decompositions of multiple output logic functions
• Bi-decomposition of function sets in multiple-valued logic for circuit design and data mining

This page was built for publication: Decomposition of Boolean relations and functions in logic synthesis and data analysis

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