The Computational Complexity of NK Fitness Functions

@inproceedings{Wright2017TheCC,
  title={The Computational Complexity of NK Fitness Functions},
  author={Alden H. Wright},
  year={2017}
}
N-K fitness landscapes have been widely used as examples and test functions in the field of evolutionary computation. Thus, the computational complexity of these landscapes as optimization problems is of interest. We investigate the computational complexity of the problem of optimizing the N-K fitness functions and related fitness functions. We give an algorithm to optimize adjacent-model N-K fitness functions which is polynomial in N . We show that the decision problem corresponding to… CONTINUE READING
3 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

NP completeness of kauffman’s N-k model, a tuneable rugged fitness landscape

  • E. D. Weinberger
  • Tech. Rep. 96-02-003, Santa Fe Institute, 1399…
  • 1996
Highly Influential
5 Excerpts

The Origins of Order

  • S. A. Kauffman
  • 1993
Highly Influential
4 Excerpts

Fitness landscapes investigated

  • R. K. Thompson
  • Master’s thesis, University of Montana, Mansfield…
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…