1. Hochbaum, D. S., Maass, W., Approximation schemes for covering and packing problems in image processing and VLSI,Journal of the Association for Computing Machinery, 1985, 32(1): 130.
2. Garey, M. R., Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979.
3. Landau, Lifschitz,Field Theory (translated by Ren Lang and Yuan Bingnan), Beijing: People’s Educational Press, 1959.
4. Huang Wenqi, Quasi-physical and quasi-social method for tackling NP-hard problems, inProc. International Workshop on Discrete Mathematics and Algorithms 1994 (in Chinese), Guangzhou: Jinan University Press, 1994, 89–91.
5. Huang Wenqi, Jin Renchao, The quasi-physical personification algorithm for solving SAT problem—Solar,Science in China, Ser. E, 1999, 42(5): 483.