American Psychological Association 6th edition

Cai, L., Fellows, M., Juedes, D., & Rosamond, F. (2007). The Complexity of Polynomial-Time Approximation. Theory of Computing Systems, 41(3), 459-477. https://doi.org/10.1007/s00224-007-1346-y

ISO-690 (author-date, English)

CAI, Liming, FELLOWS, Michael, JUEDES, David und ROSAMOND, Frances, 2007. The Complexity of Polynomial-Time Approximation. Theory of Computing Systems. 1 Oktober 2007. Vol. 41, no. 3, p. 459-477. DOI 10.1007/s00224-007-1346-y.

Modern Language Association 9th edition

Cai, L., M. Fellows, D. Juedes, und F. Rosamond. „The Complexity of Polynomial-Time Approximation.“. Theory of Computing Systems, Bd. 41, Nr. 3, Oktober 2007, S. 459-77, https://doi.org/10.1007/s00224-007-1346-y.

Mohr Siebeck - Recht (Deutsch - Österreich)

Cai, Liming/Fellows, Michael/Juedes, David/Rosamond, Frances: The Complexity of Polynomial-Time Approximation., Theory of Computing Systems 2007, 459-477.

Emerald - Harvard

Cai, L., Fellows, M., Juedes, D. und Rosamond, F. (2007), „The Complexity of Polynomial-Time Approximation.“, Theory of Computing Systems, Vol. 41 No. 3, S. 459-477.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.