"Proof Complexity of Propositional Model Counting."

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

> Home

Details and statistics

DOI: 10.3233/SAT-231507

access: open

type: Journal Article

metadata version: 2024-11-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jsat/BeyersdorffHS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/BeyersdorffHS24
Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. J. Satisf. Boolean Model. Comput. 15(1): 27-59 (2024)

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.