Randomness and completeness in computational complexity
/ D. van Melkebeek. - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 1950)
ISBN 978-3-540-44545-6
Lizenzpflichtig
Quelle: DNB
Melkebeek, Dieter van: Randomness and completeness in computational complexity
/ Dieter VanMelkebeek. [Association for Computing Machinery]. - Berlin : Springer, 2000. - XV, 196 S. : graph. Darst.; 24 cm - (Lecture notes in computer science; Vol. 1950)
ISBN 978-3-540-41492-6 / 3-540-41492-4 kart. : DM 62.00
Literaturverz. S. 183 - 189
Quelle: DNB