Anand Louis, Rameesh Paul. No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs. In Sepehr Assadi, Eva Rotenberg, editors, 2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026. pages 538-550, SIAM, 2026. [doi]
No references recorded for this publication.
No citations of this publication recorded.