On the Readability of Monotone Boolean Formulae

DOI10.1007/978-3-642-02882-3_49MaRDI QIDQ5323097zbMATH OpenOpenAlexFDO

Authors Kazuhisa Makino, Imran Rauf, Khaled 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)

Recommendations

• On the readability of monotone Boolean formulae
• Read-Once Functions Revisited and the Readability Number of a Boolean Function
• How Do Read-Once Formulae Shrink?

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3545568 (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
• JBool
• Learning read-once formulas with queries
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Cited in

(2)

• On the readability of monotone Boolean formulae
• Amplification of Bounded Depth Monotone Read-Once Boolean Formulae

Describes a project that uses

Uses Software

• JBool

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 Q5323097)