A note on the size of minimal covers (Q845985): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Edward Hermann Haeusler / rank
 
Normal rank
Property / author
 
Property / author: Eduardo Sany Laber / rank
 
Normal rank
Property / author
 
Property / author: Loana Tito Nogueira / 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.ipl.2006.10.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128005025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical complexity of all (monotone) boolean functions and monotone graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new strategy for querying priced information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio of evaluating priced functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query strategies for priced information / rank
 
Normal rank

Latest revision as of 09:59, 2 July 2024

scientific article
Language Label Description Also known as
English
A note on the size of minimal covers
scientific article

    Statements

    A note on the size of minimal covers (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    finite combinatorial problems
    0 references
    theory of computation
    0 references
    computational complexity
    0 references
    graphs
    0 references
    Boolean functions
    0 references
    vertex cover
    0 references

    Identifiers