@inproceedings{cc7a81c66bdf40d9b23491495fb91585,
title = "Satisfiability and evolution",
abstract = "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 adaptations.",
keywords = "Boolean functions, algorithms, evolution",
author = "Adi Livnat and Christos Papadimitriou and Aviad Rubinstein and Gregory Valiant and Andrew Wan",
note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 ; Conference date: 18-10-2014 Through 21-10-2014",
year = "2014",
month = dec,
day = "7",
doi = "10.1109/FOCS.2014.62",
language = "American English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "524--530",
booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
address = "United States",
}