"Algorithms for #BIS-Hard Problems on Expander Graphs."

Matthew Jenssen, Peter Keevash, Will Perkins (2020)

> Home

Details and statistics

DOI: 10.1137/19M1286669

access: closed

type: Journal Article

metadata version: 2022-07-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/JenssenKP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/JenssenKP20
Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49(4): 681-710 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.