Counting and conjunctive queries in the lifted junction tree algorithm
From MaRDI portal
Publication:2029588
DOI10.1007/978-3-319-78102-0_3zbMath1462.68135DBLPconf/gkr/BraunM17OpenAlexW2791890060WikidataQ64363081 ScholiaQ64363081MaRDI QIDQ2029588
Publication date: 3 June 2021
Full work available at URL: https://doi.org/10.1007/978-3-319-78102-0_3
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items (1)
This page was built for publication: Counting and conjunctive queries in the lifted junction tree algorithm