Nontriviality for exponential time w.r.t. weak reducibilities (Q391074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nontriviality for Exponential Time w.r.t. Weak Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Completeness Notions for Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing nontriviality for E and EXP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 1-truth-table-hard languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly Hard Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time completeness notions / rank
 
Normal rank

Latest revision as of 04:43, 7 July 2024

scientific article
Language Label Description Also known as
English
Nontriviality for exponential time w.r.t. weak reducibilities
scientific article

    Statements

    Nontriviality for exponential time w.r.t. weak reducibilities (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    bounded truth-table reducibility
    0 references
    polynomial exponential hierarchy
    0 references
    Turing reducibility
    0 references
    many-one reducibility
    0 references
    truth-table reducibility
    0 references

    Identifiers