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.
Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024. [doi]
Abstract is missing.