Theory of Computing Systems

, Volume 52, Issue 2, pp 221–270

Parameterized Random Complexity

Article

DOI: 10.1007/s00224-011-9381-0

Cite this article as:
Montoya, J.A. & Müller, M. Theory Comput Syst (2013) 52: 221. doi:10.1007/s00224-011-9381-0

Abstract

The classes W[P] and W[1] 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[1]-randomization. This paper develops the corresponding theory.

Keywords

Parameterized complexity theory Random complexity Probability amplification Derandomization Parameterized counting complexity Uniqueness problems 

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Escuela de MatemáticasUniversidad industrial de SantanderBucaramangaColombia
  2. 2.Kurt Gödel Research CenterUniversity of ViennaViennaAustria

Personalised recommendations