Properties of uniformly hard languages (Q1041777): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2004.11.014 / rank
Normal rank
 
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/j.ipl.2004.11.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072485606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a theorem by Ladner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly hard languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2004.11.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:36, 10 December 2024

scientific article
Language Label Description Also known as
English
Properties of uniformly hard languages
scientific article

    Statements

    Properties of uniformly hard languages (English)
    0 references
    0 references
    0 references
    4 December 2009
    0 references
    computational complexity
    0 references
    uniform hardness
    0 references
    time hierarchy
    0 references
    polynomial hierarchy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references