On the Complexity of Dualization of Monotone Disjunctive Normal Forms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Enumerating minimal solution sets for metric graph problems
- Recognition and dualization of disguised bidual Horn functions.
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Incremental delay enumeration: space and time
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- On the frequency of the most frequently occurring variable in dual monotone DNFs
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Tropical polar cones, hypergraph transversals, and mean payoff games
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Lower bounds for three algorithms for transversal hypergraph generation
- Total tightness implies Nash-solvability for three-person game forms
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- Separable discrete functions: recognition and sufficient conditions
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Minimal and locally minimal games and game forms
- A structural characterization for certifying Robinsonian matrices
- Fast, flexible MUS enumeration
- Generating all maximal models of a Boolean expression
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
- Nash-solvable two-person symmetric cycle game forms
- Interior and exterior functions of positive Boolean functions.
- Bidual Horn functions and extensions
- Measuring the implications of the D-basis in analysis of data in biomedical studies
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- A note on systems with max-min and max-product constraints
- A study on monotone self-dual Boolean functions
- Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
- The complexity of dependency detection and discovery in relational databases
- On enumerating minimal dicuts and strongly connected subgraphs
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- A global parallel algorithm for the hypergraph transversal problem
- Acyclic, or totally tight, two-person game forms: characterization and main properties
- Intersecting restrictions in clutters
- An average study of hypergraphs and their minimal transversals
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- On the complexity of inducing categorical and quantitative association rules
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- Fast algorithms for implication bases and attribute exploration using proper premises
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Generating all vertices of a polyhedron is hard
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- Self-duality of bounded monotone Boolean functions and related problems
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Density condensation of Boolean formulas
- Efficient algorithms for dualizing large-scale hypergraphs
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Tree-shellability of Boolean functions
- Enumerating minimal dominating sets in chordal bipartite graphs
- Inverse subsumption for complete explanatory induction
- Extended dualization: application to maximal pattern mining
- On the counting complexity of propositional circumscription
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets
- Sequential testing of complex systems: a review
- Masking patterns in sequences: A new class of motif discovery with don't cares
- Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
- Hypergraph dualization with \textsf{FPT}-delay parameterized by the degeneracy and dimension
- Translation among CNFs, characteristic models and ordered binary decision diagrams
- Maximal sensitivity of Boolean nested canalizing functions
- On Tackling Explanation Redundancy in Decision Trees
- On the dualization in distributive lattices and related problems
- An algebraic algorithm for solving parametric integer programs
- Dual bounded generation: polynomial, second-order cone and positive semidefinite matrix inequalities
- Achieving new upper bounds for the hypergraph duality problem through logic
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- On the fractional chromatic number of monotone self-dual Boolean functions
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Generating minimal redundant and maximal irredundant subhypergraphs
- An inequality for polymatroid functions and its applications.
- Translating between the representations of a ranked convex geometry
- Enumerating maximal consistent closed sets in closure systems
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
- Monotone term decision lists
- Enumeration classes defined by circuits
- On a cone covering problem
- On necessary and sufficient conditions for solvability of game forms.
- How to apply SAT-solving for the equivalence test of monotone normal forms
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- Multivariate value at risk and related topics
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Stability of two player game structures
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems
- Sensitivities and block sensitivities of elementary symmetric Boolean functions
- Generating cut conjunctions in graphs and related problems
- Social disruption games in signed networks
- Cooperation through social influence
- On the complexity of the decisive problem in simple and weighted games
- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
- On Dualization over Distributive Lattices
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Resolution based algorithms for the transversal hypergraph generation problem
- Computational aspects of monotone dualization: a brief survey
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- scientific article; zbMATH DE number 7286679 (Why is no real title available?)
- Generating dual-bounded hypergraphs
- Covering-based numbers related to the LS-category of finite spaces
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)
