Searching for "Hardness vs Randomness." – sorted by Relevance.
-
Hardness vs. randomness
- Hardness vs. Randomness Noam Nisan 1 Institute of Computer Science Hebrew University of Jerusalem
- Cited by 221 (23 self) – Add To MetaCart
-
Hardness vs. Randomness within Alternating Time
- Hardness vs. Randomness within Alternating Time Abstract We study the complexity of building
- Cited by 10 (0 self) – Add To MetaCart
-
Hardness vs. Randomness within Alternating Time
- Hardness vs. Randomness within Alternating Time Emanuele Viola*Division of Engineering
- Add To MetaCart
-
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games
- Uniform hardness vs. randomness tradeo#s for Arthur-Merlin games Dan Gutfreund School of Computer
- Cited by 4 (0 self) – Add To MetaCart
-
Electronic Colloquium on Computational Complexity, Report No. 7 (2008) Limitations of Hardness vs
- , have used a number of ingredients that were not present in earlier works on hardness vs. randomness
- Add To MetaCart
-
unknown title
- Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games Dan Gutfreund School
- Add To MetaCart
-
P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma (Preliminary Version)
- results for hardness vs. randomness trade-offs. In particular, we show that if any problem in E = DT IME(2
- Cited by 27 (3 self) – Add To MetaCart
-
Uniform Hardness Versus Randomness Tradeoffs For Arthur-Merlin Games
- proved a uniform hardness vs. randomness “gap theorem” for BPP. We show an analogous result for AM
- Cited by 4 (3 self) – Add To MetaCart
-
Pseudo-random generators for all hardness
- ) ) and gives a direct proof of the optimal hardness vs. randomness tradeoff in [2], which can be stated
- Cited by 40 (8 self) – Add To MetaCart
-
The Bright Side of Hardness: Relating Computational Complexity and Cryptography
- PRG iff OWF ("Hardness vs Randomness") 2 10 Pseudoerandom Functions 3 11 Cryptography: private
- Add To MetaCart

