On the Readability of Monotone Boolean Formulae

DOI10.1007/978-3-642-02882-3_49zbMATH Open1248.68214OpenAlexW1823092762MaRDI QIDQ5323097FDOQ5323097

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

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?

Mathematics Subject Classification ID

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

Cites Work

• JBool
• Title not available (Why is that?)
• Learning read-once formulas with queries
• Intersection Theorems for Systems of Sets
• Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
• Title not available (Why is that?)
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
• A characterization of span program size and improved lower bounds for monotone span programs

Cited In (2)

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

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)