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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theory of computing systems Ročník 52; číslo 2; s. 221 - 270
Hlavní autori: Montoya, Juan Andrés, Müller, Moritz
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer-Verlag 01.02.2013
Springer Nature B.V
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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