The complexity of unions of disjoint sets (Q955349): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Selman, Alan L. / rank
Normal rank
 
Property / author
 
Property / author: Selman, Alan L. / 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.jcss.2008.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073363580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unique satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splittings, Robustness, and Structure of Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion complete tally languages and the Hartmanis-Berman conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly hard languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability and one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines that Can Output Empty Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3764142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Reductions to NP-Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference and truth-table hierarchies for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural Self-Reducible Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703297 / rank
 
Normal rank

Latest revision as of 20:42, 28 June 2024

scientific article
Language Label Description Also known as
English
The complexity of unions of disjoint sets
scientific article

    Statements

    The complexity of unions of disjoint sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2008
    0 references
    0 references
    structural complexity
    0 references
    NP-hard set
    0 references
    p-selective set
    0 references
    mitotic set
    0 references
    0 references