Complete sets and closeness to complexity classes (Q4727430): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Uwe Schoening / rank
Normal rank
 
Property / author
 
Property / author: Uwe Schoening / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-immune sets for complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / 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: Circuit-size lower bounds and non-reducibility to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse oracles for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong nondeterministic polynomial-time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / 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: Reductions on NP and p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Enumeration Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / 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

Latest revision as of 19:41, 17 June 2024

scientific article; zbMATH DE number 4001484
Language Label Description Also known as
English
Complete sets and closeness to complexity classes
scientific article; zbMATH DE number 4001484

    Statements

    Complete sets and closeness to complexity classes (English)
    0 references
    0 references
    1986
    0 references
    0 references
    polynomial time
    0 references
    binary strings
    0 references
    polynomially close
    0 references
    Boolean closure
    0 references
    sparse sets
    0 references
    0 references