On the hardness of finding balanced independent sets in random bipartite graphs
- Award ID(s):
- 2309708
- PAR ID:
- 10501353
- Publisher / Repository:
- SIAM
- Date Published:
- Journal Name:
- Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
