Computational aspects of monotone dualization: a brief survey (Q943839): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59259620, #quickstatements; #temporary_batch_1712688784189
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning conjunctions of Horn clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
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: Dualization, decision lists and identification of monotone discrete functions / 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: Generating dual-bounded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for polymatroid functions and its applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449202 / 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: On maximal frequent and minimal infrequent sets in binary matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-bounded generating problems: Weighted 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: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805968 / 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: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact transversal hypergraphs and application to Boolean \(\mu\)-functions / 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: Q4708957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on monotone dualization and generating hypergraph transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Horn functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidual Horn functions and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736835 / 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: On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correction to the algorithm in Reiter's theory of diagnosis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the frequency of the most frequently occurring variable in dual monotone DNFs / 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: Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Boolean dualization is in co-NP\([\log^{2}n]\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Transversal Hypergraph Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental method for generating prime implicants/implicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems: Duality Relations and a New Method of Solution / 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 computation of hitting sets: Review and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3261003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms / 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: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for inferring functional dependencies from relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness: A retrospective / 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: Q5650538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SE-tree-based prime implicant generation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all monotone Boolean functions are polynomially learnable using membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating Prime Implicants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal evaluation of monotonic Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Average Query Complexity of Learning Monotone Boolean Functions / 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: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Reiter's hitting-set algorithm / rank
 
Normal rank

Latest revision as of 16:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Computational aspects of monotone dualization: a brief survey
scientific article

    Statements

    Computational aspects of monotone dualization: a brief survey (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dualization
    0 references
    monotone Boolean functions
    0 references
    hypergraphs
    0 references
    transversals
    0 references
    hitting sets
    0 references
    independent sets
    0 references
    set coverings
    0 references
    self-duality
    0 references
    output-polynomial algorithms
    0 references
    polynomial-total time
    0 references
    quasi-polynomial time
    0 references
    combinatorial enumeration
    0 references
    limited nondeterminism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references