The following pages link to Emanuele Viola (Q261364):
Displayed 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\) (Q626620) (← links)
- On approximate majority and probabilistic time (Q626665) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Local reduction (Q1641001) (← links)
- Local expanders (Q1653336) (← links)
- The complexity of constructing pseudorandom generators from hard functions (Q1766819) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
- On beating the hybrid argument (Q2826078) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- The Complexity of Distributions (Q2884580) (← links)
- The communication complexity of interleaved group products (Q2941525) (← links)
- Real Advantage (Q2947588) (← links)
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators (Q3000561) (← links)
- (Q3002796) (← links)
- Pseudorandom Bits for Polynomials (Q3068640) (← links)
- A computational view of market efficiency (Q3088324) (← links)
- Extractors for Turing-Machine Sources (Q3167435) (← links)
- (Q3191596) (← links)
- On the Power of Small-Depth Computation (Q3400006) (← links)
- Local Reductions (Q3448833) (← links)
- Using nondeterminism to amplify hardness (Q3580969) (← links)
- (Q4448380) (← links)
- (Q4601849) (← links)
- (Q4602401) (← links)
- Interleaved Group Products (Q4634030) (← links)
- (Q4636457) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Bit-Probe Lower Bounds for Succinct Data Structures (Q4910576) (← links)
- Quadratic Maps Are Hard to Sample (Q4973863) (← links)
- The Coin Problem for Product Tests (Q4973882) (← links)
- (Q5002695) (← links)
- AC0 Unpredictability (Q5061882) (← links)
- (Q5093396) (← links)
- (Q5111144) (← links)
- (Q5140841) (← links)
- How to Store a Random Walk (Q5146792) (← links)
- Short PCPs with Projection Queries (Q5167739) (← links)
- Bounded Independence Fools Halfspaces (Q5171173) (← links)
- Bit-probe lower bounds for succinct data structures (Q5172742) (← links)
- Constant-Error Pseudorandomness Proofs from Hardness Require Majority (Q5205815) (← links)
- Bounded Independence versus Symmetric Tests (Q5205817) (← links)
- (Q5215665) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- (Q5302083) (← links)