The following pages link to Madhur Tulsiani (Q2802522):
Displaying 31 items.
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Graph densification (Q2826070) (← links)
- (Q2913812) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- (Q3549626) (← links)
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs (Q3582782) (← links)
- SDP Gaps for 2-to-1 and Other Label-Cover Variants (Q3587413) (← links)
- Improved Pseudorandom Generators for Depth 2 Circuits (Q3588430) (← links)
- Optimal Sherali-Adams Gaps from Pairwise Independence (Q3638873) (← links)
- (Q4568111) (← links)
- (Q4607924) (← links)
- Proving Weak Approximability Without Algorithms (Q4636452) (← links)
- (Q5111141) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- List Decoding of Direct Sum Codes (Q5146861) (← links)
- The Complexity of Somewhat Approximation Resistant Predicates (Q5167783) (← links)
- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (Q5167806) (← links)
- CSP gaps and reductions in the lasserre hierarchy (Q5172724) (← links)
- Approximability of <i>p</i> → <i>q</i> Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness (Q5236267) (← links)
- A characterization of strong approximation resistance (Q5259599) (← links)
- Algorithmic regularity for polynomials and applications (Q5363110) (← links)
- (Q5365058) (← links)
- (Q5365139) (← links)
- Linear Programming Hierarchies Suffice for Directed Steiner Tree (Q5419003) (← links)
- Quadratic Goldreich--Levin Theorems (Q5494937) (← links)
- Quadratic Goldreich-Levin Theorems (Q5495034) (← links)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
- (Q6126248) (← links)
- (Q6126329) (← links)
- Explicit SoS lower bounds from high-dimensional expanders (Q6348872) (← links)
- Concentration of polynomial random matrices via Efron-Stein inequalities (Q6409876) (← links)
