The following pages link to Emanuele Viola (Q261364):
Displayed 24 items.
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313041) (← links)
- Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates (Q5346309) (← links)
- Hardness Amplification Proofs Require Majority (Q5390590) (← links)
- Bounded Independence Fools Halfspaces (Q5390601) (← links)
- Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (Q5415496) (← links)
- (Q5417611) (← links)
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates (Q5422492) (← links)
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two (Q5449840) (← links)
- Using Nondeterminism to Amplify Hardness (Q5470719) (← links)
- Extractors for Circuit Sources (Q5494933) (← links)
- Extractors for Circuit Sources (Q5494966) (← links)
- Randomness Buys Depth for Approximate Counting (Q5494967) (← links)
- Shielding circuits with groups (Q5495795) (← links)
- The communication complexity of addition (Q5741754) (← links)
- On the Complexity of Information Spreading in Dynamic Networks (Q5741760) (← links)
- Approximate Degree, Weight, and Indistinguishability (Q5868884) (← links)
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs (Q5891772) (← links)
- Improved Separations between Nondeterministic and Randomized Multiparty Communication (Q5892180) (← links)
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs (Q5895071) (← links)
- Improved Separations between Nondeterministic and Randomized Multiparty Communication (Q5900476) (← links)
- (Q6070398) (← links)
- (Q6126321) (← links)
- (Q6126362) (← links)
- Quasirandom groups enjoy interleaved mixing (Q6402782) (← links)