Polynomial terse sets (Q1104077): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/0890-5401(88)90044-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041943346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonalizations over polynomial time computable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terse, superterse, and verbose sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unique satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / 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: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching, Merging, and Sorting in Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Presburger arithmetic with fixed quantifier dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues of semirecursive sets and effective reducibilities to the study of NP complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parallel Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 18 June 2024

scientific article
Language Label Description Also known as
English
Polynomial terse sets
scientific article

    Statements

    Polynomial terse sets (English)
    0 references
    0 references
    0 references
    1988
    0 references
    terse sets
    0 references
    polynomial time
    0 references
    NP-complete
    0 references
    Boolean hierarchy
    0 references

    Identifiers