Melkebeek, D. v. (2000). Randomness and completeness in computational complexity. Springer.
Citación estilo ChicagoMelkebeek, Dieter van. Randomness and Completeness in Computational Complexity. Berlin: Springer, 2000.
Cita MLAMelkebeek, Dieter van. Randomness and Completeness in Computational Complexity. Springer, 2000.
Warning: These citations may not always be 100% accurate.