Separating NE from Some Nonuniform Nondeterministic Complexity Classes (Q5323096): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ang Sheng Li / rank
Normal rank
 
Property / author
 
Property / author: Ang Sheng Li / 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.1007/978-3-642-02882-3_48 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1823436195 / 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: On sets Turing reducible to p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds of the closeness between complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Problems and Strong Polynomial Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semi-feasible algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity theory / 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: Separating classes in the exponential-time hierarchy from classes in PH / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reducibility of sets inside NP to sets with low information content / 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: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / 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

Latest revision as of 20:22, 1 July 2024

scientific article; zbMATH DE number 5585648
Language Label Description Also known as
English
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
scientific article; zbMATH DE number 5585648

    Statements

    Separating NE from Some Nonuniform Nondeterministic Complexity Classes (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2009
    0 references
    0 references
    0 references