A low and a high hierarchy within NP (Q1052097): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/0022-0000(83)90027-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011042573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second step toward the polynomial hierarchy / 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: Inclusion complete tally languages and the Hartmanis-Berman conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability: structure and theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / 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: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Enumeration Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to obtain diagonal sets in complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:37, 14 June 2024

scientific article
Language Label Description Also known as
English
A low and a high hierarchy within NP
scientific article

    Statements

    A low and a high hierarchy within NP (English)
    0 references
    0 references
    1983
    0 references
    0 references
    NP-complete
    0 references
    polynomial reduction
    0 references
    polynomial hierarchy
    0 references
    0 references