Pages that link to "Item:Q2508337"
From MaRDI portal
The following pages link to Complexity of identification and dualization of positive Boolean functions (Q2508337):
Displaying 50 items.
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets (Q444438) (← links)
- Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
- On fuzzy relational equations and the covering problem (Q545381) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- On the relation between fuzzy max-Archimedean t-norm relational equations and the covering problem (Q1040915) (← links)
- Dualization, decision lists and identification of monotone discrete functions (Q1286397) (← links)
- Minimal samples of positive examples identifying \(k\)-CNF Boolean functions (Q1333259) (← links)
- Logical analysis of numerical data (Q1365054) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- Pareto-optimal patterns in logical analysis of data (Q1885813) (← links)
- Decompositions of positive self-dual Boolean functions (Q1893164) (← links)
- Interior and exterior functions of Boolean functions (Q1923581) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Maximal sensitivity of Boolean nested canalizing functions (Q2272408) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Logical analysis of data -- the vision of Peter L. Hammer (Q2385443) (← links)
- The complexity of modular decomposition of Boolean functions (Q2387426) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- On the positive and the inversion complexity of Boolean functions (Q3142263) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Dual subimplicants of positive Boolean functions (Q4946700) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Advances in Artificial Intelligence (Q5901319) (← links)
