Shivam Nadimpalli
@shivamnadimpalli.bsky.social
📤 230
📥 71
📝 5
CS Theory postdoc at MIT (
https://math.mit.edu/~shivamn
)
reposted by
Shivam Nadimpalli
Clément Canonne
11 days ago
Theoretical CS community! I have a small favor to ask. If you ever used, read, watched some of the (excellent IMO) exposition content by Ryan O'Donnell, would you mind filling this very short survey, and maybe say how useful to you it was? 📝
forms.gle/xrvc2mLRbMqK...
Please spread this!
#TCSSky
2
16
7
reposted by
Shivam Nadimpalli
Clément Canonne
2 months ago
Learning a lot at the first
#FOCS2025
Best Student Paper award, by Rahul Ilango!
1
27
2
Wow! 😮
loading . . .
Talagrand's convolution conjecture up to loglog via perturbed reverse heat
We prove that under the heat semigroup $(P_τ)$ on the Boolean hypercube, any nonnegative function $f: \{-1,1\}^n \to \mathbb{R}_+$ exhibits a uniform tail bound that is better than that by Markov's in...
https://arxiv.org/abs/2511.19374?fbclid=IwZXh0bgNhZW0CMTEAc3J0YwZhcHBfaWQPNDM3NjI2MzE2OTczNzg4AAEee52ku-V_yjQttLeaMVa9sY5qvdNt25AqR6PyUGxau58mOAyNJWmPQj-JN_8_aem_ZKncICuJCyqyV_vAJgFpfA
3 months ago
0
2
0
reposted by
Shivam Nadimpalli
Henry Yuen
3 months ago
My student
@johnbostanci.bsky.social
, Chinmay Nirkhe, Jonas Haferkamp, and Mark Zhandry have put out a tour-de-force paper that shows, relative to a classical oracle, QMA is stronger than QCMA -- i.e., quantum proofs >> classical proofs. Congratulations to the authors!
arxiv.org/abs/2511.09551
loading . . .
Separating QMA from QCMA with a classical oracle
We construct a classical oracle proving that, in a relativized setting, the set of languages decidable by an efficient quantum verifier with a quantum witness (QMA) is strictly bigger than those decid...
https://arxiv.org/abs/2511.09551
1
47
6
A very exciting result!!
arxiv.org/pdf/2511.045...
3 months ago
0
3
0
reposted by
Shivam Nadimpalli
TCS+
4 months ago
The Zoom link for Aparna's talk on "Quantum One-Time Programs, Revisited" is now available on our website. See you tomorrow, 1pm ET!
www.tcsplus.org/welcome/next...
add a skeleton here at some point
0
3
2
reposted by
Shivam Nadimpalli
Tom Gur
6 months ago
New arXiv preprint: we show algorithmic versions of the polynomial Freiman–Ruzsa (PFR) theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms.
arxiv.org/pdf/2509.02338
2
27
3
reposted by
Shivam Nadimpalli
Clément Canonne
7 months ago
Fun facts: the Pizza theorem 🍕 states that if Alice and Bob cut a pizza in 4k slices (for k≥2) and take alternating slices, they'll get the same amount even if the cutting wasn't centered. It was proven by Upton in 1968. Before that, nobody knew how to cut pizza.
en.m.wikipedia.org/wiki/Pizza_t...
loading . . .
Pizza theorem - Wikipedia
https://en.m.wikipedia.org/wiki/Pizza_theorem
3
59
13
reposted by
Shivam Nadimpalli
TCS+
10 months ago
💡The first talks of the season are available! - Prasanna Ramakrishnan, "How to Appease a Voter Majority" - Or Zamir, "Optimality of Frequency Moment Estimation" - Tom Gur, "A Zero-Knowledge PCP Theorem" - Ryan Williams, "Simulating Time With Square-Root Space"
sites.google.com/view/tcsplus...
loading . . .
TCS+ - 2024-2025
2025/04/23: Ryan Williams, "Simulating Time With Square-Root Space" Ryan Williams (MIT)
https://sites.google.com/view/tcsplus/welcome/past-talks/2024-2025?authuser=0
1
10
5
The introduction is also extremely fun to read!
add a skeleton here at some point
10 months ago
1
3
0
reposted by
Shivam Nadimpalli
TCS+
10 months ago
📢 Our fourth TCS+ talk will be Wednesday, April 23 (10amPT, 1pm ET, 19:00 CEST): Ryan Williams (
@rrwilliams.bsky.social
), from MIT, will tell us about "Simulating Time With Square-Root Space"! RSVP to receive the link (available one day prior to the talk):
forms.gle/hi9pBsgjRBMb...
#TCSSky
loading . . .
TCS+ RSVP: Ryan Williams (2025/05/23)
Title: Simulating Time With Square-Root Space
https://forms.gle/hi9pBsgjRBMbzTEn7
0
12
6
I got a lot out of participating in WALDO back in 2021, so I definitely recommend checking it out! 😄
add a skeleton here at some point
11 months ago
0
7
1
reposted by
Shivam Nadimpalli
TCS+
11 months ago
Bob* your calendar, as they say! *Mark?
1
10
4
I'm a fan of this post!
loading . . .
Accessible TeX colors
Ewin's website
https://ewintang.com/blog/2025/01/12/colors/
12 months ago
2
23
4
reposted by
Shivam Nadimpalli
TCS+
12 months ago
Teaser: our first TCS+ of the season will be March 5 by Prasanna Ramakrishnan (Stanford), telling us "How to Appease a Voter Majority." (We'd usually suggest cookies, lots of cookies 🍪 — but it turns out there is a better way!) Mark the data: more details in the days to come!
0
7
5
reposted by
Shivam Nadimpalli
Ryan Williams
12 months ago
New paper: Simulating Time With Square-Root Space
people.csail.mit.edu/rrw/time-vs-...
It's still hard for me to believe it myself, but I seem to have shown that TIME[t] is contained in SPACE[sqrt{t log t}]. To appear in STOC. Comments are very welcome!
loading . . .
https://people.csail.mit.edu/rrw/time-vs-space.pdf
17
264
88
reposted by
Shivam Nadimpalli
Timothy Gowers
about 1 year ago
There have been several remarkable developments in combinatorics, my field of mathematics. A few weeks ago I gave a talk to a general mathematical audience in which I described six breakthroughs from the last five years.
www.youtube.com/watch?v=726O...
loading . . .
Timothy Gowers, Some recent developments in combinatorics
YouTube video by Clay Mathematics Institute
https://www.youtube.com/watch?v=726OMrvJAtU
12
143
47
you reached the end!!
feeds!
log in