On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2007.05.030 / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.05.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005389099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / 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: Complexity of identification and dualization of positive Boolean functions / 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: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualization of regular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804207 / 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: 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: 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: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921700 / 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: Q4473243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386975 / 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: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268444 / 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: On the Complexity of Some Enumeration Problems for Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global parallel algorithm for the hypergraph transversal problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations / 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: 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: Design by example: An application of Armstrong relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness: A retrospective / 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: Q3997892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / 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: Q3026386 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2007.05.030 / rank
 
Normal rank

Latest revision as of 09:12, 10 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of monotone dualization and generating minimal hypergraph transversals
scientific article

    Statements

    On the complexity of monotone dualization and generating minimal hypergraph transversals (English)
    0 references
    10 September 2008
    0 references
    dualization
    0 references
    hypergraph transversals
    0 references
    generation algorithms
    0 references
    monotone Boolean functions
    0 references
    polynomial space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references