On collapsing the polynomial-time hierarchy (Q1339382): 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 / Wikidata QID
 
Property / Wikidata QID: Q61687092 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Observations on Separating Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Languages Reducible to Algorithmically Random Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on probability versus randomness with applications to complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic complexity classes and lowness / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:45, 23 May 2024