"Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, ..."

MIT Hardness Group et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2024.51

access: open

type: Conference or Workshop Paper

metadata version: 2024-12-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/GroupBDDGHSZ24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/GroupBDDGHSZ24
MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou:
Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs. ISAAC 2024: 51:1-51:14

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.