On the BDD of a random Boolean function
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1948534
- Ordered binary decision diagrams and the Shannon effect
- On the size of binary decision diagrams representing Boolean functions
- A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
- High accuracy asymptotic bounds on the BDD size and weight of the hardest functions
Cited in
(9)- Some problems of spectral analysis of random Boolean functions with constraints
- Oblivious bounds on the probability of boolean functions
- High accuracy asymptotic bounds on the BDD size and weight of the hardest functions
- scientific article; zbMATH DE number 3916176 (Why is no real title available?)
- scientific article; zbMATH DE number 4025336 (Why is no real title available?)
- scientific article; zbMATH DE number 1948534 (Why is no real title available?)
- A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
- Minimizability of random Boolean functions
- Random Boolean formulas representing any Boolean function with asymptotically equal probability
This page was built for publication: On the BDD of a random Boolean function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463959)