Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Proof Complexity of Propositional Model Counting."

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

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2024-03-05

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/BeyersdorffHS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/BeyersdorffHS24
Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. Electron. Colloquium Comput. Complex. TR24: TR24-030 (2024)

a service of

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.