Algorithms for #BIS-Hard Problems on Expander Graphs
- Award ID(s):
- 1847451
- PAR ID:
- 10168970
- Date Published:
- Journal Name:
- SIAM Journal on Computing
- Volume:
- 49
- Issue:
- 4
- ISSN:
- 0097-5397
- Page Range / eLocation ID:
- 681 to 710
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

