---
res:
bibo_abstract:
- 'There are deep, yet largely unexplored, connections between computer science
and biology. Both disciplines examine how information proliferates in time and
space. Central results in computer science describe the complexity of algorithms
that solve certain classes of problems. An algorithm is deemed efficient if it
can solve a problem in polynomial time, which means the running time of the algorithm
is a polynomial function of the length of the input. There are classes of harder
problems for which the fastest possible algorithm requires exponential time. Another
criterion is the space requirement of the algorithm. There is a crucial distinction
between algorithms that can find a solution, verify a solution, or list several
distinct solutions in given time and space. The complexity hierarchy that is generated
in this way is the foundation of theoretical computer science. Precise complexity
results can be notoriously difficult. The famous question whether polynomial time
equals nondeterministic polynomial time (i.e., P = NP) is one of the hardest open
problems in computer science and all of mathematics. Here, we consider simple
processes of ecological and evolutionary spatial dynamics. The basic question
is: What is the probability that a new invader (or a new mutant)will take over
a resident population?We derive precise complexity results for a variety of scenarios.
We therefore show that some fundamental questions in this area cannot be answered
by simple equations (assuming that P is not equal to NP).@eng'
bibo_authorlist:
- foaf_Person:
foaf_givenName: Rasmus
foaf_name: Ibsen-Jensen, Rasmus
foaf_surname: Ibsen-Jensen
foaf_workInfoHomepage: http://www.librecat.org/personId=3B699956-F248-11E8-B48F-1D18A9856A87
- foaf_Person:
foaf_givenName: Krishnendu
foaf_name: Chatterjee, Krishnendu
foaf_surname: Chatterjee
foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-4561-241X
- foaf_Person:
foaf_givenName: Martin
foaf_name: Nowak, Martin
foaf_surname: Nowak
bibo_doi: 10.1073/pnas.1511366112
bibo_issue: '51'
bibo_volume: 112
dct_date: 2015^xs_gYear
dct_language: eng
dct_publisher: National Academy of Sciences@
dct_title: Computational complexity of ecological and evolutionary spatial dynamics@
fabio_hasPubmedId: '26644569'
...