back to list

Project: Computational Complexity of Probabilistic Circuits


This internal project aims at studying and devising new bounds for the computational complexity of inferences in probabilistic circuits and their robust/credal counterpart, including approximation results and fixed-parameter tractability. It requires mathematical interest and good knowledge of theory of computation. This is a theoretical work and results are mostly obtained in the form of hardness proofs, but often (theoretical or practical) algorithms are devised to show the quality of approximation results.

Relevant literature:

Cassio de Campos
Get in contact