APA (7th ed.) Citation

Aida, S., Schuler, R., Tsukiji, T., & Watanabe, O. (2002). The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Theory of Computing Systems, 35(4), 449. https://doi.org/10.1007/s00224-002-1025-y

Chicago Style (17th ed.) Citation

Aida, Shin, Rainer Schuler, Tatsuie Tsukiji, and Osamu Watanabe. "The Difference Between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems." Theory of Computing Systems 35, no. 4 (2002): 449. https://doi.org/10.1007/s00224-002-1025-y.

MLA (9th ed.) Citation

Aida, Shin, et al. "The Difference Between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems." Theory of Computing Systems, vol. 35, no. 4, 2002, p. 449, https://doi.org/10.1007/s00224-002-1025-y.