Probabilistic parameterized polynomial time

DOI10.1007/978-3-030-10801-4_15MaRDI QIDQ2206227zbMATH OpenOpenAlexFDO

Authors Nils Donselaar

Publication date 22 October 2020

Full work available at URL https://arxiv.org/abs/1811.01651

zbMATH Keywords

Bayesian networksrandomized computationparameterized complexity theory

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Randomized algorithms (68W20) Parameterized complexity, tractability and kernelization (68Q27)

Abstract: 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 parameter, based on a proposal by Kwisthout in [15,16]. We prove that this class, for which we propose the shorthand name PPPT, has a robust definition and is in fact equal to the intersection of the classes paraBPP and PP. This result is accompanied by a Cook-style proof of completeness for the corresponding promise class (under a suitable notion of reduction) for parameterized approximation versions of the inference problem in Bayesian networks, which is known to be PP-complete. With these definitions and results in place, we proceed by showing how it follows from this that derandomization is equivalent to efficient deterministic approximation methods for the inference problem. Furthermore, we observe as a straightforward application of a result due to Drucker in [8] that these problems cannot have polynomial size randomized kernels unless the polynomial hierarchy collapses to the third level. We conclude by indicating potential avenues for further exploration and application of this framework.

Recommendations

• A higher-order characterization of probabilistic polynomial time
• A higher-order characterization of probabilistic polynomial time
• On relativized probabilistic polynomial time algorithms
• Parameterized random complexity
• Polynomial time approximation schemes and parameterized complexity
• Mathematical Foundations of Computer Science 2004
• Restricted relativizations of probabilistic polynomial time
• Polynomial time decision algorithms for probabilistic automata
• Parameterized analogues of probabilistic computation
• Probabilistic polynomial time is closed under parity reductions

Cited in

(4)

• scientific article; zbMATH DE number 7204268 (Why is no real title available?)
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• scientific article; zbMATH DE number 1444332 (Why is no real title available?)
• Parameterized analogues of probabilistic computation

This page was built for publication: Probabilistic parameterized polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206227)