On self-reducibility and weak P-selectivity (Q1054475): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/0022-0000(83)90013-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069139349 / 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: Some lowness properties and computational complexity sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160434 / 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: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sparse Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum value problem and NP real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Circuit-Size Complexity and the Low Hierarchy in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, Approximation and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / 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: Some observations on NP real numbers and P-selective sets / 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: Computational complexity, speedable and levelable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 09:16, 14 June 2024

scientific article
Language Label Description Also known as
English
On self-reducibility and weak P-selectivity
scientific article

    Statements

    On self-reducibility and weak P-selectivity (English)
    0 references
    1983
    0 references
    NP
    0 references
    self-reducibility
    0 references
    lowness
    0 references
    P-selective sets
    0 references
    left Dedekind cuts
    0 references
    polynomial-time m-completeness
    0 references
    polynomial-time T-completeness
    0 references
    0 references

    Identifiers