Skip to main content
Conference Proceedings

Parameterized derandomization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5018 LNCS 148-159
DOI: 10.1007/978-3-540-79723-4_15
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The class W[P] is a parameterized analogue of NP. Chen et al. [4] have given a machine characterization of W[P]. The corresponding machine model gives rise to a parameterized analogue of BPP. What is the connection between parameterized and classical derandomization? © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Müller, M. (2008). Parameterized derandomization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5018 LNCS, pp. 148–159). https://doi.org/10.1007/978-3-540-79723-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free