Skip to content

Author

Prashanti Anderson

We have 2 of 4 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Certifiable Near-Optimality: A Simple Framework for Unifying Search and Refutation for (Semi)random CSPs

A classical problem in average-case complexity is the study of random constraint satisfaction problems (CSPs). Random CSPs are traditionally studied in two different settings: refutation, where the instances are uniformly random and thus unsatisfiable with high probability, and search, where the instances are drawn fro...

Prashanti Anderson, Peter Manohar, Jeff Xu · 0 citations
Preprint Aug 2026

A Simple Algorithm for Best Separable State

A new variant of the "pinning lemma", a measure-decomposition theorem widely used in LP/SDP rounding, high-dimensional probability, and statistical physics, is proved, which the authors believe is of independent interest.

Prashanti Anderson, Sam Hopkins, Amit Rajaraman · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.