Generating dual-bounded hypergraphs
From MaRDI portal
Cites work
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
- A New Algorithm for Generating All the Maximal Independent Sets
- An O(nm)-time algorithm for computing the dual of a regular Boolean function
- An O(m n) algorithm for regular set-covering problems
- An ordering (enumerative) algorithm for nonlinear \(0-1\) programming
- Complexity of identification and dualization of positive Boolean functions
- Design by example: An application of Armstrong relations
- Dual subimplicants of positive Boolean functions
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Dualization of regular Boolean functions
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- scientific article; zbMATH DE number 1670855 (Why is no real title available?)
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 49085 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 1947411 (Why is no real title available?)
- scientific article; zbMATH DE number 1754587 (Why is no real title available?)
- scientific article; zbMATH DE number 1929933 (Why is no real title available?)
- scientific article; zbMATH DE number 2086380 (Why is no real title available?)
- scientific article; zbMATH DE number 3326167 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Interior and exterior functions of Boolean functions
- New results on monotone dualization and generating hypergraph transversals
- On frequent sets of Boolean matrices
- On generating all maximal independent sets
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the frequency of the most frequently occurring variable in dual monotone DNFs
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations
- Rado's theorem for polymatroids
- The Maximum Latency and Identification of Positive Boolean Functions
- The solvability of positional games in pure strategies
Cited in
(10)- Efficient algorithms for dualizing large-scale hypergraphs
- Discovery of the D-basis in binary tables based on hypergraph dualization
- Measuring the implications of the D-basis in analysis of data in biomedical studies
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
- Generating minimal redundant and maximal irredundant subhypergraphs
- Enumerating minimal defensive alliances
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- 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
- Scientific contributions of Leo Khachiyan (a short overview)
This page was built for publication: Generating dual-bounded hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405941)
