Pages that link to "Item:Q626665"
From MaRDI portal
The following pages link to On approximate majority and probabilistic time (Q626665):
Displaying 14 items.
- Randomness buys depth for approximate counting (Q483707) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Skew circuits of small width (Q2173307) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Skew Circuits of Small Width (Q3196384) (← links)
- (Q4612476) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- (Q5093396) (← links)
- (Q5158501) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
