Pages that link to "Item:Q813315"
From MaRDI portal
The following pages link to Derandomizing Arthur-Merlin games using hitting sets (Q813315):
Displaying 32 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- The complexity of estimating min-entropy (Q260395) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- Derandomizing Arthur-Merlin games under uniform assumptions (Q1601037) (← links)
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games (Q1762663) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- Pseudorandomness for approximate counting and sampling (Q2460030) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- On zero error algorithms having oracle access to one query (Q2498984) (← links)
- Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) (Q3088174) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- (Q4472503) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- New Computational Paradigms (Q5717081) (← 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)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)