External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Proof Complexity of Propositional Model Counting

Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting. In Meena Mahajan, Friedrich Slivovsky, editors, 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. Volume 271 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Olaf Beyersdorff

This author has not been identified. Look up 'Olaf Beyersdorff' in Google

Tim Hoffmann

This author has not been identified. Look up 'Tim Hoffmann' in Google

Luc Nicolas Spachmann

This author has not been identified. Look up 'Luc Nicolas Spachmann' in Google
runs on