On the Complexity of Dualization of Monotone Disjunctive Normal Forms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Translation among CNFs, characteristic models and ordered binary decision diagrams
- On the fractional chromatic number of monotone self-dual Boolean functions
- Lower bounds for three algorithms for transversal hypergraph generation
- Minimal and locally minimal games and game forms
- On the frequency of the most frequently occurring variable in dual monotone DNFs
- Interior and exterior functions of positive Boolean functions.
- An inequality for polymatroid functions and its applications.
- On necessary and sufficient conditions for solvability of game forms.
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- Separable discrete functions: recognition and sufficient conditions
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- An algebraic algorithm for solving parametric integer programs
- Recognition and dualization of disguised bidual Horn functions.
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Sequential testing of complex systems: a review
- On the complexity of inducing categorical and quantitative association rules
- Pareto-optimal patterns in logical analysis of data
- Multivariate value at risk and related topics
- Bidual Horn functions and extensions
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Inner-core and outer-core functions of partially defined Boolean functions
- On the dualization in distributive lattices and related problems
- Translating between the representations of a ranked convex geometry
- Sensitivities and block sensitivities of elementary symmetric Boolean functions
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- The complexity of dependency detection and discovery in relational databases
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
- Certificate complexity of elementary symmetric Boolean functions
- Enumerating maximal consistent closed sets in closure systems
- Fast algorithms for implication bases and attribute exploration using proper premises
- Maximal sensitivity of Boolean nested canalizing functions
- Incremental delay enumeration: space and time
- On the logical analysis of partially ordered data in the supervised classification problem
- Resolution based algorithms for the transversal hypergraph generation problem
- Finding maximal independent elements of products of partial orders (the case of chains)
- Asymptotically optimal dualization algorithms
- An average study of hypergraphs and their minimal transversals
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Factoring Boolean functions using graph partitioning
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Efficient algorithms for dualizing large-scale hypergraphs
- On enumerating minimal dicuts and strongly connected subgraphs
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- Cooperation through social influence
- Extended dualization: application to maximal pattern mining
- Intersecting restrictions in clutters
- One approach to decoding monotone logical function
- Fast, flexible MUS enumeration
- On maximal chain subgraphs and covers of bipartite graphs
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- On the complexity of the decisive problem in simple and weighted games
- Generating all maximal models of a Boolean expression
- The minimal hitting set generation problem: algorithms and computation
- Counting minimal dominating sets
- Enumerating minimal hypotheses and dualizing monotone Boolean functions on lattices
- How to apply SAT-solving for the equivalence test of monotone normal forms
- Enumeration of minimal dominating sets and variants
- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
- Total tightness implies Nash-solvability for three-person game forms
- Inverse subsumption for complete explanatory induction
- Generating dual-bounded hypergraphs
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets
- NP-completeness: a retrospective
- Achieving new upper bounds for the hypergraph duality problem through logic
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Enumerating minimal transversals of hypergraphs without small holes
- On quantifying literals in Boolean logic and its applications to explainable AI
- On Tackling Explanation Redundancy in Decision Trees
- Discovery of the D-basis in binary tables based on hypergraph dualization
- Dualization in lattices given by ordered sets of irreducibles
- RQL: a query language for rule discovery in databases
- Algorithms for k-meet-semidistributive lattices
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- scientific article; zbMATH DE number 7286679 (Why is no real title available?)
- scientific article; zbMATH DE number 7310243 (Why is no real title available?)
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- A study on monotone self-dual Boolean functions
- Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames
- Measuring the implications of the D-basis in analysis of data in biomedical studies
- Stoichiometric and constraint-based analysis of biochemical reaction networks
- A structural characterization for certifying Robinsonian matrices
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
- Mathematical Foundations of Computer Science 2005
- Tropical polar cones, hypergraph transversals, and mean payoff games
- Generating all vertices of a polyhedron is hard
- Monotone term decision lists
This page was built for publication: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837390)
