On gamma-reducibility versus polynomial time many-one reducibility (Q1149766): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank

Latest revision as of 11:37, 13 June 2024

scientific article
Language Label Description Also known as
English
On gamma-reducibility versus polynomial time many-one reducibility
scientific article

    Statements

    On gamma-reducibility versus polynomial time many-one reducibility (English)
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    equivalence of complexity classes
    0 references
    gamma-reducibility
    0 references
    0 references