New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4370034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Round Interactive Proofs in Finite Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles and queries that are sufficient for exact learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Collapse Consequences of NP Having Small Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit size relative to pseudorandom oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Arthur-Merlin versus Merlin-Arthur games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic complexity classes and lowness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank

Latest revision as of 16:25, 5 June 2024

scientific article
Language Label Description Also known as
English
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes.
scientific article

    Statements

    New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (English)
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    lowness
    0 references
    self-reducible set
    0 references
    interactive proof system
    0 references
    probabilistic class
    0 references
    function class
    0 references
    program checker.
    0 references
    0 references