Parameterized Random Complexity
- First Online:
- Cite this article as:
- Montoya, J.A. & Müller, M. Theory Comput Syst (2013) 52: 221. doi:10.1007/s00224-011-9381-0
- 166 Downloads
The classes W[P] and W are parameterized analogues of NP in that they can be characterized by machines with restricted existential nondeterminism. These machine characterizations give rise to two natural notions of parameterized randomized algorithms that we call W[P]-randomization and W-randomization. This paper develops the corresponding theory.