On P-immunity of exponential time complete sets (Q1362336): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Nicholas Q. Tran / rank
Normal rank
 
Property / author
 
Property / author: Nicholas Q. Tran / 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.1006/jcss.1997.1488 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023067253 / 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: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Problems and Strong Polynomial Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immunity of complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On one-way functions and polynomial-time isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism conjecture fails relative to a random oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Productivity, Approximations, and Levelability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turing machine time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:55, 27 May 2024