11 citations · 21 across the 9 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 6 cited
Many bounded versions of undecidable problems are NP-hard
Andreas Klingler, Mirte van der Eyden, Sebastian Stengele +2
Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results…
math.ST2022★ 11 cited
The d-separation criterion in Categorical Probability
Tobias Fritz, Andreas Klingler
The d-separation criterion detects the compatibility of a joint probability distribution with a directed acyclic graph through certain conditional independences. In this work, we s…