The Decomposition Tree for analyses of Boolean functions
From MaRDI portal
Publication:5458074
Recommendations
Cites work
- scientific article; zbMATH DE number 3902554 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 44419 (Why is no real title available?)
- scientific article; zbMATH DE number 714922 (Why is no real title available?)
- Improving the variable ordering of OBDDs is NP-complete
- On the Fourier spectrum of monotone functions
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Polynomial-time algorithms for generation of prime implicants
- Single-faced Boolean functions and their minimization
- The Maximum Latency and Identification of Positive Boolean Functions
- The Problem of Simplifying Truth Functions
Cited in
(8)- scientific article; zbMATH DE number 1379304 (Why is no real title available?)
- scientific article; zbMATH DE number 1931923 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3989366 (Why is no real title available?)
- Associative and commutative tree representations for Boolean functions
- Experimental comparison of decomposition methods for systems of Boolean function
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)