On the Readability of Monotone Boolean Formulae

DOI10.1007/978-3-642-02882-3_49zbMath1248.68214OpenAlexW1823092762MaRDI QIDQ5323097

Kazuhisa Makino, Imran Rauf, Khaled M. Elbassioni

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://link.springer.com/10.1007/s10878-009-9283-0

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• JBool
• A characterization of span program size and improved lower bounds for monotone span programs
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
• 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

This page was built for publication: On the Readability of Monotone Boolean Formulae