Probabilistic parameterized polynomial time
From MaRDI portal
Publication:2206227
DOI10.1007/978-3-030-10801-4_15zbMATH Open1445.68115arXiv1811.01651OpenAlexW2898913421MaRDI QIDQ2206227
Author name not available (Why is that?)
Publication date: 22 October 2020
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.
Full work available at URL: https://arxiv.org/abs/1811.01651
No records found.
No records found.
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)
