A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Random Sources, Hitting Sets, and BPP Simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sample of Samplers: A Computational Perspective on Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decisive characterization of BPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating BPP using a general weak random source / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053654064 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 30 July 2024

scientific article
Language Label Description Also known as
English
A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
scientific article

    Statements

    Identifiers