Pages that link to "Item:Q1762663"
From MaRDI portal
The following pages link to Uniform hardness versus randomness tradeoffs for Arthur-Merlin games (Q1762663):
Displaying 14 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- Natural Proofs versus Derandomization (Q2805512) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Constructive separations and their consequences (Q6566463) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
