Parameterized Random Complexity

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]-rando...

Full description

Saved in:
Bibliographic Details
Published in:Theory of computing systems Vol. 52; no. 2; pp. 221 - 270
Main Authors: Montoya, Juan Andrés, Müller, Moritz
Format: Journal Article
Language:English
Published: New York Springer-Verlag 01.02.2013
Springer Nature B.V
Subjects:
Algorithms
Complexity
Complexity theory
Computation
Computer Science
Probability
Studies
Theory of Computation
Random complexity
Uniqueness problems
Derandomization
Parameterized counting complexity
Parameterized complexity theory
Probability amplification
ISSN:1432-4350, 1433-0490
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-011-9381-0