Decomposability of partially defined Boolean functions
type: Item
instance of: scholarly article
title: Decomposability of partially defined Boolean functions
zbMATH Open document ID: 0833.68090
DOI: 10.1016/0166-218X(94)00145-4
author: Endre Boros
author: Peter L. Hammer
author: Toshihide Ibaraki
author: Alex Kogan
author: Vladimir Gurvich
published in: Discrete Applied Mathematics
publication date: 1996-03-11T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 806407
zbMATH Keywords: partially functions
zbMATH Keywords: partially defined Boolean functions
zbMATH Keywords: decomposability
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
Wikidata QID: Q59560933
cites work: Compositional complexity of Boolean functions
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Q5600472
cites work: Decompositions of positive self-dual Boolean functions
cites work: Q3491589
cites work: Synthesis of Combinational Logic Using Decomposition and Probability
cites work: Decomposing a relation into a tree of binary relations
cites work: Structure identification in relational data
cites work: Q4198056
cites work: Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions
cites work: Q5630824
cites work: Q3668890
cites work: Q3997892
cites work: Q5684536
DBLP publication ID: journals/dam/BorosGHIK95
description: scientific article; zbMATH DE number 806407