Recommendations
Cites work
- Boolean Normal Forms, Shellability, and Reliability Computations
- Complexity of identification and dualization of positive Boolean functions
- Disjoint Products and Efficient Computation of Reliability
- Dualization of regular Boolean functions
- scientific article; zbMATH DE number 4095482 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Matroids and a Reliability Analysis Problem
- More characterizations of triangulated graphs
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- Shellable Decompositions of Cells and Spheres.
- Shellings of spheres and polytopes
- The Maximum Latency and Identification of Positive Boolean Functions
Cited in
(3)
This page was built for publication: Tree-shellability of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958139)