Ansh Nagda

According to our database, Ansh Nagda authored at least 6 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On optimal distinguishers for Planted Clique.

Ansh Nagda, Prasad Raghavendra

CoRR, May, 2025

Improved approximation algorithms for the EPR Hamiltonian.

Nathan Ju, Ansh Nagda

CoRR, April, 2025

On Approximability of the Permanent of PSD Matrices.

Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2022

Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs.

Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries.

Yu Chen, Sanjeev Khanna, Ansh Nagda

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Near-linear Size Hypergraph Cut Sparsifiers.

Yu Chen, Sanjeev Khanna, Ansh Nagda

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020