Van Melkebeek, D. (2000). Randomness and completeness in computational complexity. Springer. https://doi.org/10.1007/3-540-44545-5
Chicago Style (17th ed.) CitationVan Melkebeek, Dieter. Randomness and Completeness in Computational Complexity. Berlin [u.a.]: Springer, 2000. https://doi.org/10.1007/3-540-44545-5.
MLA (9th ed.) CitationVan Melkebeek, Dieter. Randomness and Completeness in Computational Complexity. Springer, 2000. https://doi.org/10.1007/3-540-44545-5.
Warning: These citations may not always be 100% accurate.