On the readability of monotone Boolean formulae

DOI10.1007/s10878-009-9283-0zbMath1229.90090OpenAlexW2159727921MaRDI QIDQ652622

Kazuhisa Makino, Imran Rauf, Khaled M. Elbassioni

Publication date: 15 December 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9283-0

zbMATH Keywords

monotone Boolean functionsread-once functionsreadabilitycomplexity of monotone Boolean functions

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Recognizing read-once functions from depth-three formulas

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of span program size and improved lower bounds for monotone span programs
• The subchromatic number of a graph
• 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
• 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