Hardness vs randomness (Q1337458): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/jcss/NisanW94, #quickstatements; #temporary_batch_1731530891435
 
(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: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / 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: 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: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Randomized Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912481 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56815522 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/NisanW94 / rank
 
Normal rank

Latest revision as of 22:03, 13 November 2024

scientific article
Language Label Description Also known as
English
Hardness vs randomness
scientific article

    Statements

    Identifiers