The Decomposition Tree for analyses of Boolean functions

DOI10.1017/S096012950800666XzbMATH Open1141.68027MaRDI QIDQ5458074FDOQ5458074

Swetlana Nikolajewa, Thomas Wilhelm, Maik Friedel

Publication date: 10 April 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 3989366
• The complexity of AND-decomposition of Boolean functions
• Decomposition of Boolean functions applying the apparatus of Boolean derivatives
• Decompositions of four variable Boolean functions

Mathematics Subject Classification ID

Data structures (68P05) Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Problem of Simplifying Truth Functions
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Improving the variable ordering of OBDDs is NP-complete
• On the Fourier spectrum of monotone functions
• The Maximum Latency and Identification of Positive Boolean Functions
• Title not available (Why is that?)
• Polynomial-time algorithms for generation of prime implicants
• Title not available (Why is that?)
• Single-faced Boolean functions and their minimization

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tree Decomposition with Function Filtering
• A decomposition scheme for the analysis of fault trees and other combinatorial circuits
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• Title not available (Why is that?)
• Associative and commutative tree representations for Boolean functions
• Experimental comparison of decomposition methods for systems of Boolean function

Uses Software

• JBool

This page was built for publication: The Decomposition Tree for analyses of Boolean functions

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