"Model Counting for CNF Formulas of Bounded Modular Treewidth."

Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider (2016)

> Home

Details and statistics

DOI: 10.1007/S00453-015-0030-X

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/PaulusmaSS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/PaulusmaSS16
Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica 76(1): 168-194 (2016)

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.