3 papers
cs.CC2022
Parameterized Complexity Results for Bayesian Inference
Hans Bodlaender, Nils Donselaar, Johan Kwisthout
We present completeness results for inference in Bayesian networks with respect to two different parameterizations, namely the number of variables and the topological vertex separa…
cs.CC2020
On the computational power and complexity of Spiking Neural Networks
Johan Kwisthout, Nils Donselaar
The last decade has seen the rise of neuromorphic architectures based on artificial spiking neural networks, such as the SpiNNaker, TrueNorth, and Loihi systems. The massive parall…
cs.CC2018
Probabilistic Parameterized Polynomial Time
Nils Donselaar
We examine a parameterized complexity class for randomized computation where only the error bound and not the full runtime is allowed to depend more than polynomially on the parame…