3 citations · 3 across the 17 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Pseudorandomness of Expander Walks via Fourier Analysis on Groups
Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy
One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet , and study the mean of…
cs.CC2020
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones +2
The Sum-of-Squares (SoS) hierarchy is a semi-definite programming meta-algorithm that captures state-of-the-art polynomial time guarantees for many optimization problems such as Ma…