On the readability of monotone Boolean formulae
type: Item
instance of: scholarly article
title: On the readability of monotone Boolean formulae
zbMATH Open document ID: 1229.90090
author: Kazuhisa Makino
author: Imran Rauf
author: Khaled Elbassioni
published in: Journal of Combinatorial Optimization
publication date: 2011-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5988535
zbMATH Keywords: read-once functions
zbMATH Keywords: monotone Boolean functions
zbMATH Keywords: readability
zbMATH Keywords: complexity of monotone Boolean functions
describes a project that uses: JBool
MaRDI profile type: Publication
full work available at URL: s10878-009-9283-0
OpenAlex ID: W2159727921
cites work: The subchromatic number of a graph
cites work: Learning read-once formulas with queries
cites work: Q3622253
cites work: Intersection Theorems for Systems of Sets
cites work: A characterization of span program size and improved lower bounds for monotone span programs
cites work: Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
cites work: Q4120519
cites work: Q4695825
cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
cites work: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
cites work: Q3762226
DOI: 10.1007/S10878-009-9283-0
description: scientific article; zbMATH DE number 5988535