"Algorithms for #BIS-hard problems on expander graphs."

Matthew Jenssen, Peter Keevash, Will Perkins (2019)

> Home

Details and statistics

DOI: 10.1137/1.9781611975482.135

access: open

type: Conference or Workshop Paper

metadata version: 2022-07-08

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/JenssenKP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/JenssenKP19
Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. SODA 2019: 2235-2247

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.