The computational complexity of N-K fitness functions

IEEE Transactions on Evolutionary Computation

Volumn 4, Issue 4, 2000, Pages 373-379

  Wright, Alden H ^a   Thompson, Richard K ^a   Zhang, Jian ^a  

^a UNIVERSITY OF MONTANA   (United States)

Author keywords

Computational complexity; N K fitness function; Optimization

Indexed keywords

ALGORITHMS; DECISION THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

FITNESS FUNCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0034317854     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.887236     Document Type: Article

References (8)

1. S. A. Kauffman, The Origins of Order. New York: Oxford University Press, 1993.
2. E. D. Weinberger. (1996) NP completeness of Kauffman's N-K model, a tuneable rugged fitness landscape. Tech. Rep. 96-02-003, Santa Fe Institute, Santa Fe, NM. [Online]. Available: http://www.santafe.edu/sfi/publications/96wplist.html
3. R. K. Thompson, "Fitness landscapes investigated," Master's thesis. University of Montana, Computer Science Department, Mansfield Library, Missoula, MT, 1995.
4. J. Zhang, "NK fitness functions," Master's thesis, University of Montana, Computer Science Department, Mansfield Library, Missoula, MT, 1997.
5. M. R. Garey and D. S. Johnson, Computers and Intractibility. San Francisco: W. H. Freeman and Company, 1979.
6. C. Papadimitriou, Computational Complexity. Reading, MA: Addison-Wesley, 1994.
7. C. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," in Proc. 20th ACM Symp. Theory Computing. New York: ACM, 1988, pp. 299-334.
8. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and hardness of approximation problems," in Proc. 33rd IEEE Symp. Foundations Comp. Sci. Piscataway, NJ: IEEE, 1992, pp. 14-23.