Hypergraph Acyclicity and Propositional Model Counting

DOI10.1007/978-3-319-09284-3_29zbMath1423.68206arXiv1401.6307OpenAlexW1484192075MaRDI QIDQ3192085

Stefan Mengel, Florent Capelli, Arnaud Durand

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.6307

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65)

Related Items (1)

Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT

This page was built for publication: Hypergraph Acyclicity and Propositional Model Counting