Parameterized Analogues of Probabilistic Computation

DOI10.1007/978-3-319-14974-5_18zbMath1432.68192arXiv1409.7790OpenAlexW1516803018MaRDI QIDQ5174962

B. V. Raghavendra Rao, Ankit Chauhan

Publication date: 19 February 2015

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (4)

Parameterised counting in logspace ⋮ The challenges of unbounded treewidth in parameterised subgraph counting problems ⋮ A note on parameterized polynomial identity testing using hitting set generators ⋮ On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models

This page was built for publication: Parameterized Analogues of Probabilistic Computation