Randomness is Hard (Q2706121)

From MaRDI portal
Revision as of 09:07, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Randomness is Hard
scientific article

    Statements

    title
    Randomness is Hard (English)
    0 references
    author
    Harry Buhrman
    0 references
    Leen Torenvliet
    0 references
    publication date
    19 March 2001
    0 references
    Mathematics Subject Classification ID
    68Q30
    0 references
    68Q15
    0 references
    68Q17
    0 references
    68Q19
    0 references
    03D15
    0 references
    68Q10
    0 references
    zbMATH DE Number
    1578760
    0 references
    zbMATH Keywords
    complexity classes
    0 references
    CD complexity
    0 references
    CND complexity
    0 references
    interactive proofs
    0 references
    Kolmogorov complexity
    0 references
    Merlin-Arthur
    0 references
    Arthur-Merlin
    0 references
    randomness
    0 references
    relativization
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2706121&oldid=27168975"
    Powered by MediaWiki