Will Perkins 0001, Yuzhou Wang. On the hardness of finding balanced independent sets in random bipartite graphs. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 2376-2397, SIAM, 2024. [doi]
No references recorded for this publication.
No citations of this publication recorded.