Pseudorandom bits for constant depth circuits (Q808707): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / 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: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom number generation and space complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank

Revision as of 08:36, 24 June 2024

scientific article
Language Label Description Also known as
English
Pseudorandom bits for constant depth circuits
scientific article

    Statements

    Pseudorandom bits for constant depth circuits (English)
    0 references
    0 references
    1991
    0 references
    pseudo-random bit generators
    0 references
    uniform family of circuits of polynomial size and constant depth
    0 references
    complexity class AM
    0 references
    NP
    0 references

    Identifiers