Cita APA (7a ed.)
Dieter Melkebeek. (2000). Randomness and Completeness in Computational Complexity. Springer.
Cita estilo Chicago (17a ed.)
Dieter Melkebeek. Randomness and Completeness in Computational Complexity. Berlín, Alemania: Springer, 2000.
Cita MLA (9a ed.)
Dieter Melkebeek. Randomness and Completeness in Computational Complexity. Springer, 2000.
אזהרה: ציטוטים אלה לעיתים לא מדויקים ב 100%.