Madhur Tulsiani
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
on a stage with
all 9 in the filters
who talks about the same things
- Tushant Mittal2 talks
- Fernando Granha Jeronimo3 talks
- Yuval Filmus9 talks
- Toniann Pitassi5 talks
- Prahladh Harsha4 talks
- Dor Minzer8 talks
| title | conference | date |
|---|---|---|
| Explicit Abelian Lifts and Quantum LDPC Codes | ITCS 2022 | 2022-01-31 |
Constructs polynomial-time explicit d-regular expanders that are Z_L lifts (and more generally transitive abelian lifts) for L up to about 2^{cN}… | ||
| Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem | ITCS 2022 | 2022-01-31 |
Proves NP-hardness of approximating the (bilinear) Grothendieck problem strictly beyond the PSD bound: shows no polytime algorithm achieves better than π/2 +… | ||
| Explicit SoS lower bounds from high-dimensional expanders | ITCS 2021 | 2021-01-06 |
Constructs deterministic, polynomial-time Max-3-XOR instances from Ramanujan complexes whose true optimum is at most 1 − μ (μ a fixed constant, e.g. ~0.1) yet… | ||
| From Weak to Strong LP Gaps for all CSPs | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Madhur Tulsiani, Toyota Technological Institute at Chicago
https://simons.berkeley.edu/talks/madhur-tulsiani-11-9-17
Hierarchies, Extended Formulations and… | ||
| nothing matches | ||