New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
From MaRDI portal
Publication:6657241
DOI10.1016/J.DAM.2024.10.019MaRDI QIDQ6657241
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
dualizationhypergraph transversalmonotone Boolean functionquasi-polynomial timefull coverclutter and blocker
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Computational aspects of monotone dualization: a brief survey
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- The complexity of facets (and some facets of complexity)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Complexity of identification and dualization of positive Boolean functions
- Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the width—length inequality
- The Forbidden Minors of Binary Clutters
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Experimental comparison of the two Fredman-Khachiyan-algorithms
- On the Complexity of Some Enumeration Problems for Matroids
- A Solution of the Shannon Switching Game
- Bottleneck extrema
- Advances in Artificial Intelligence
- Double description method revisited
This page was built for publication: New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657241)