Suhail Sherif
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
on a stage with
- Ankit Gargonce
- Arkadev Chattopadhyayonce
- Nikhil S. Mandeonce
all 6 in the filters
who talks about the same things
- Ankit Garg3 talks
- Arkadev Chattopadhyay6 talks
- Makrand Sinha5 talks
- Anindya De3 talks
- Raghu Meka5 talks
- Toniann Pitassi5 talks
| title | conference | date |
|---|---|---|
| Lifting to Parity Decision Trees via Stifling (with applications to proof complexity) | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Proves a lifting theorem that turns any deterministic decision tree lower bound for a relation R into a parity decision tree size lower bound for R composed… | ||
| Lifting to Parity Decision Trees Via Stifling | ITCS 2023 | 2023-01-10 |
Proves a concrete lifting theorem: parity decision tree (PDT) size of S composed with majority on 3 bits is at least 2^{DT(S)}, and more generally if gadget g… | ||
| No quantum speedup over gradient descent for non-smooth convex optimization | ITCS 2021 | 2021-01-06 |
Proves that quantum algorithms give no asymptotic advantage for non‑smooth 1‑Lipschitz convex optimization in high dimension by showing a matching 1/epsilon^2… | ||
| nothing matches | ||