On the complexity of the dualization problem
From MaRDI portal
Recommendations
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Asymptotically optimal dualization algorithms
- Computational aspects of monotone dualization: a brief survey
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- Asymptotic estimates for the number of solutions of the dualization problem and its generalizations
Cites work
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Asymptotic estimates for the number of solutions of the dualization problem and its generalizations
- Construction of irredundant coverings of a Boolean matrix
- Discrete analysis of feature descriptions in recognition problems of high dimensionality
- Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial Boolean functions
- scientific article; zbMATH DE number 3841261 (Why is no real title available?)
- scientific article; zbMATH DE number 3903997 (Why is no real title available?)
- scientific article; zbMATH DE number 3474790 (Why is no real title available?)
- scientific article; zbMATH DE number 2208745 (Why is no real title available?)
- On generating all maximal independent sets
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- On the complexity of discrete generation problems
- On the construction of irredundant coverings of an integer matrix
- On the number of irreducible coverings of an integer matrix
- The complexity of the realization of certain recognition procedures
Cited in
(18)- An O(nm)-time algorithm for computing the dual of a regular Boolean function
- Problems, models and complexity. II: Application to the DLSP
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- Finding maximal independent elements of products of partial orders (the case of chains)
- Asymptotically optimal dualization algorithms
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Asymptotic estimates for the number of solutions of the dualization problem and its generalizations
- Enumerating minimal hypotheses and dualizing monotone Boolean functions on lattices
- scientific article; zbMATH DE number 4133855 (Why is no real title available?)
- Enumerating Minimally Revised Specifications Using Dualization
- The Big Mother of all Dualities: Möller Algorithm
- Construction of irredundant coverings of a Boolean matrix
- Dualization in lattices given by ordered sets of irreducibles
- scientific article; zbMATH DE number 7310243 (Why is no real title available?)
- On the complexity of discrete generation problems
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
- scientific article; zbMATH DE number 2208745 (Why is no real title available?)
- Polynomial-delay construction of irreducible coverings of a Boolean matrix
This page was built for publication: On the complexity of the dualization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2838941)
