Minimum self-dual decompositions of positive dual-minor Boolean functions
type: Item
instance of: scholarly article
title: Minimum self-dual decompositions of positive dual-minor Boolean functions
zbMATH Open document ID: 0944.68003
DOI: 10.1016/S0166-218X(99)00096-7
author: Jan C. Bioch
author: Toshihide Ibaraki
author: Kazuhisa Makino
published in: Discrete Applied Mathematics
publication date: 2000-03-02T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1389875
zbMATH Keywords: Boolean function
MaRDI profile type: Publication
cites work: Learning read-once formulas with queries
cites work: Critical hypergraphs for the weak chromatic number
cites work: On the composition and decomposition of clutters
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: Decompositions of positive self-dual Boolean functions
cites work: Dualization of regular Boolean functions
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions
cites work: How to assign votes in a distributed system
cites work: Q3628775
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Q3292914
cites work: Q4198056
cites work: The solvability of positional games in pure strategies
cites work: Q4120519
cites work: Q3741636
cites work: Q5721231
cites work: Optimal coteries for rings and related networks
cites work: On generating all maximal independent sets
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: The fundamental theorem of voting schemes
cites work: Functions computed by monotone Boolean formulas with no repeated variables
cites work: Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales
cites work: Q5655273
cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis
cites work: Q3997892
cites work: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
cites work: A theory of the learnable
cites work: Q3762226
full work available at URL: s0166-218x(99)00096-7
OpenAlex ID: W1969508865
Wikidata QID: Q127646758
description: scientific article; zbMATH DE number 1389875