On the readability of monotone Boolean formulae
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5548206 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 3545568 (Why is no real title available?)
- scientific article; zbMATH DE number 219938 (Why is no real title available?)
- A characterization of span program size and improved lower bounds for monotone span programs
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Intersection Theorems for Systems of Sets
- Learning read-once formulas with queries
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- The subchromatic number of a graph
Cited in
(5)
This page was built for publication: On the readability of monotone Boolean formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652622)