Complexity of identification and dualization of positive Boolean functions
From MaRDI portal
Publication:2508337
Recommendations
- The Maximum Latency and Identification of Positive Boolean Functions
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
- Dual subimplicants of positive Boolean functions
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- Computational aspects of monotone dualization: a brief survey
Cited in
(62)- Translation among CNFs, characteristic models and ordered binary decision diagrams
- On the fractional chromatic number of monotone self-dual Boolean functions
- On the relation between fuzzy max-Archimedean t-norm relational equations and the covering problem
- Dualization, decision lists and identification of monotone discrete functions
- Minimal samples of positive examples identifying \(k\)-CNF Boolean functions
- Logical analysis of numerical data
- Error-free and best-fit extensions of partially defined Boolean functions
- Interior and exterior functions of positive Boolean functions.
- An inequality for polymatroid functions and its applications.
- Almost all monotone Boolean functions are polynomially learnable using membership queries
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- 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
- Sequential testing of complex systems: a review
- Pareto-optimal patterns in logical analysis of data
- Decompositions of positive self-dual Boolean functions
- Interior and exterior functions of Boolean functions
- 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
- Translating between the representations of a ranked convex geometry
- 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
- Maximal sensitivity of Boolean nested canalizing functions
- Resolution based algorithms for the transversal hypergraph generation problem
- 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
- Logical analysis of data -- the vision of Peter L. Hammer
- The complexity of modular decomposition of Boolean functions
- The minimal hitting set generation problem: algorithms and computation
- Enumerating minimal hypotheses and dualizing monotone Boolean functions on lattices
- On the positive and the inversion complexity of Boolean functions
- A duality between Boolean functions
- The Maximum Latency and Identification of Positive Boolean Functions
- Generating dual-bounded hypergraphs
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets
- scientific article; zbMATH DE number 2080451 (Why is no real title available?)
- Achieving new upper bounds for the hypergraph duality problem through logic
- Dual subimplicants of positive Boolean functions
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- Dualization of Boolean functions using ternary decision diagrams
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- On fuzzy relational equations and the covering problem
- Advances in Artificial Intelligence
- Tree-shellability of Boolean functions
- On Dualization over Distributive Lattices
- Exact learning of subclasses of CDNF formulas with membership queries
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Hypergraph Horn functions
- Generating minimal redundant and maximal irredundant subhypergraphs
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
- Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
- Dual bounded generation: polynomial, second-order cone and positive semidefinite matrix inequalities
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- Computational aspects of monotone dualization: a brief survey
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Self-duality of bounded monotone Boolean functions and related problems
This page was built for publication: Complexity of identification and dualization of positive Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508337)
