On the fractional chromatic number of monotone self-dual Boolean functions
type: Item
instance of: scholarly article
title: On the fractional chromatic number of monotone self-dual Boolean functions
zbMATH Open document ID: 1170.05308
author: Daya Ram Gaur
author: Kazuhisa Makino
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5542381
zbMATH Keywords: monotone self-dual functions
zbMATH Keywords: fractional chromatic number
zbMATH Keywords: hypergraph transversals
zbMATH Keywords: non-dominated coteries
describes a project that uses: LPbook
MaRDI profile type: Publication
full work available at URL: j.disc.2008.01.028
OpenAlex ID: W1982921028
cites work: Critical hypergraphs for the weak chromatic number
cites work: Q3993087
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: LATIN 2004: Theoretical Informatics
cites work: Dual subimplicants of positive Boolean functions
cites work: Dualization of regular Boolean functions
cites work: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: Q4708957
cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals
cites work: Computational aspects of monotone dualization: a brief survey
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: How to assign votes in a distributed system
cites work: Q4473243
cites work: Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Q4083461
cites work: Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
cites work: The Maximum Latency and Identification of Positive Boolean Functions
cites work: Algorithm Theory - SWAT 2004
cites work: NP-completeness: A retrospective
cites work: An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
cites work: The availability of crumbling wall quorum systems
cites work: Q3997892
cites work: Q4382863
cites work: Linear programming. Foundations and extensions
DOI: 10.1016/J.DISC.2008.01.028
Recommended article: On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions
Recommended article: Choosability and fractional chromatic numbers
Recommended article: Fractional Turan's theorem and bounds for the chromatic number
Recommended article: Q4473243
Recommended article: Self-duality of bounded monotone Boolean functions and related problems
Recommended article: On the fractionalf-chromatic index of a graph
Recommended article: On the fractional chromatic number, the chromatic number, and graph products
Recommended article: Fractional Thue chromatic number of graphs
Recommended article: On the fractional chromatic index of a graph and its complement
Recommended article: The fractional chromatic number of mycielski's graphs
description: scientific article; zbMATH DE number 5542381