Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An O(m n) algorithm for regular set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of identification and dualization of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast learning of \(k\)-term DNF formulas with queries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualization of regular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure identification in relational data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to assign votes in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring minimal functional dependencies in Horn and q-Horn theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Latency and Identification of Positive Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design by example: An application of Armstrong relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for some classes of sentences without quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473243 / rank
 
Normal rank

Latest revision as of 12:23, 5 June 2024

scientific article
Language Label Description Also known as
English
Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
scientific article

    Statements

    Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (English)
    0 references
    0 references
    9 March 2003
    0 references
    dualization
    0 references
    monotone Boolean function
    0 references
    \(k\)-term DNF
    0 references
    hypergraph
    0 references
    transversal computation
    0 references
    combinatorial enumeration
    0 references
    polynomial total time algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers