On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm.

Marcel Gehrke

On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm.

Original language	English
Publication status	Published - 2021

Research Areas and Centers

Centers: Center for Artificial Intelligence Luebeck (ZKIL)
Research Area: Intelligent Systems

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

https://dblp.org/rec/journals/corr/abs-2110-09197

Cite this

@conference{b87cc074c7564312a655754200607903,

title = "On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm.",

author = "Marcel Gehrke",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2021",

language = "English",

}

TY - CONF

T1 - On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm.

AU - Gehrke, Marcel

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2021

Y1 - 2021

M3 - Conference Papers

ER -