An improvement on the complexity of factoring read-once Boolean functions
type: Item
instance of: scholarly article
title: An improvement on the complexity of factoring read-once Boolean functions
zbMATH Open document ID: 1145.94028
author: Martin Charles Golumbic
author: Aviad Mintz
author: Udi Rotics
published in: Discrete Applied Mathematics
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 94D10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 5324139
zbMATH Keywords: read-once functions
zbMATH Keywords: logic
zbMATH Keywords: cographs
MaRDI profile type: Publication
full work available at URL: j.dam.2008.02.011
OpenAlex ID: W2031298013
cites work: Learning read-once formulas with queries
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q3328583
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: A simple linear time algorithm for cograph recognition
cites work: Factoring Boolean functions using graph partitioning
DOI: 10.1016/J.DAM.2008.02.011
description: scientific article; zbMATH DE number 5324139