Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Counting and conjunctive queries in the lifted junction tree algorithm

From MaRDI portal
Publication:2029588
Jump to:navigation, search

DOI10.1007/978-3-319-78102-0_3zbMath1462.68135DBLPconf/gkr/BraunM17OpenAlexW2791890060WikidataQ64363081 ScholiaQ64363081MaRDI QIDQ2029588

Yanyan Li

Publication date: 3 June 2021

Full work available at URL: https://doi.org/10.1007/978-3-319-78102-0_3



Mathematics Subject Classification ID

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)

Lifted Dynamic Junction Tree Algorithm




This page was built for publication: Counting and conjunctive queries in the lifted junction tree algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2029588&oldid=14504167"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki