Satisfiability and Evolution

  title={Satisfiability and Evolution},
  author={Adi Livnat and Christos H. Papadimitriou and Aviad Rubinstein and Andrew Wan},
  journal={2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
We show that, if truth assignments on n variables reproduce through recombination so that satisfaction of a particular Boolean function confers a small evolutionary advantage, then a polynomially large population over polynomially many generations (polynomial in n and the inverse of the initial satisfaction probability) will end up almost certainly consisting exclusively of satisfying truth assignments. We argue that this theorem sheds light on the problem of the evolution of complex… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
14 Citations
19 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…