1 citations · 1 across the 9 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Marton's conjecture in polynomial time
Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal +1
Gowers, Green, Manners, and Tao (Annals '25) recently resolved Marton's polynomial Freiman-Ruzsa conjecture. We give an algorithmic counterpart to their result: given uniform sampl…
cs.CC2026
Exponentially Fewer-Server PIR from Sparser -Decoding Polynomials
Aparna Gupte, Seyoon Ragavan
We show that under a plausible number-theoretic conjecture, for any constant there exists an -server private information retrieval (PIR) protocol that on an -bit database…