The Decomposition Tree for analyses of Boolean functions
From MaRDI portal
Publication:5458074
DOI10.1017/S096012950800666XzbMath1141.68027MaRDI QIDQ5458074
Swetlana Nikolajewa, Thomas Wilhelm, Maik Friedel
Publication date: 10 April 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time algorithms for generation of prime implicants
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Single-faced Boolean Functions and their Minimization
- On the Fourier spectrum of monotone functions
- The Maximum Latency and Identification of Positive Boolean Functions
- Improving the variable ordering of OBDDs is NP-complete
- The Problem of Simplifying Truth Functions