"Proof Complexity of Propositional Model Counting."

Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SAT.2023.2

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/sat/BeyersdorffHS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/BeyersdorffHS23
Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. SAT 2023: 2:1-2:18

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.