On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3747725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial terse sets / 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: Tally languages and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets Truth-Table Reducible to Sparse Sets / 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 complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sparse Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-reducibility and weak P-selectivity / 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: A note on sparse oracles for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricting the Size of Oracles Compared with Restricting Access to Oracles / 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: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / 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: Some observations on NP real numbers and P-selective sets / 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: Reductions on NP and p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Results on Polynomial Time Truth-Table Reductions to Sparse 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: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hardness of one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / 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

Revision as of 14:06, 21 June 2024

scientific article
Language Label Description Also known as
English
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
scientific article

    Statements

    On polynomial-time truth-table reducibility of intractable sets to P-selective sets (English)
    0 references
    0 references
    1991
    0 references
    reducibility
    0 references
    low sets
    0 references
    polynomial-time hierarchy
    0 references
    nonpositive reducibilities
    0 references
    0 references
    0 references
    0 references

    Identifiers