Li-shan, K., Yan, L., & Yu-ping, C. (2001). A tentative research on complexity of Automatic Programming. Wuhan University Journal of Natural Sciences, 6(1-2), 59-62. https://doi.org/10.1007/bf03160226
ISO-690 (author-date, English)LI-SHAN, Kang, YAN, Li und YU-PING, Chen, 2001. A tentative research on complexity of Automatic Programming. Wuhan University Journal of Natural Sciences. 1 März 2001. Vol. 6, no. 1-2, p. 59-62. DOI 10.1007/bf03160226.
Modern Language Association 9th editionLi-shan, K., L. Yan, und C. Yu-ping. „A Tentative Research on Complexity of Automatic Programming“. Wuhan University Journal of Natural Sciences, Bd. 6, Nr. 1-2, März 2001, S. 59-62, https://doi.org/10.1007/bf03160226.
Mohr Siebeck - Recht (Deutsch - Österreich)Li-shan, Kang/Yan, Li/Yu-ping, Chen: A tentative research on complexity of Automatic Programming, Wuhan University Journal of Natural Sciences 2001, 59-62.
Emerald - HarvardLi-shan, K., Yan, L. und Yu-ping, C. (2001), „A tentative research on complexity of Automatic Programming“, Wuhan University Journal of Natural Sciences, Vol. 6 No. 1-2, S. 59-62.