All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size

Florin Manea, Victor Mitrana. All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. Inf. Process. Lett., 103(3):112-118, 2007. [doi]

@article{ManeaM07:1,
  title = {All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size},
  author = {Florin Manea and Victor Mitrana},
  year = {2007},
  doi = {10.1016/j.ipl.2007.03.001},
  url = {http://dx.doi.org/10.1016/j.ipl.2007.03.001},
  researchr = {https://researchr.org/publication/ManeaM07%3A1},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {103},
  number = {3},
  pages = {112-118},
}