An average study of hypergraphs and their minimal transversals (Q2355712): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.06.052 / 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.tcs.2015.06.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W857871428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-colorability of random hypergraphs / 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: Phase transition of random non-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in random uniform hypergraphs / 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: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / 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: Q5431930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / 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: A new approach to the orientation of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for dualizing large-scale hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic complexity of undecidable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creation and Growth of Components in a Random Hypergraph Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all monotone Boolean functions are polynomially learnable using membership queries / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.06.052 / rank
 
Normal rank

Latest revision as of 04:15, 18 December 2024

scientific article
Language Label Description Also known as
English
An average study of hypergraphs and their minimal transversals
scientific article

    Statements

    An average study of hypergraphs and their minimal transversals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2015
    0 references
    hypergraph
    0 references
    minimal transversal
    0 references
    enumeration
    0 references
    probabilistic analysis
    0 references
    average complexity
    0 references
    generic complexity
    0 references

    Identifiers

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