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

Manea, Florin; Mitrana, Victor

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

2007 | journal article

Jump to: Cite & Linked | Documents & Media | Details | Version history

Cite this publication

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
Manea, F. & Mitrana, V. (2007)
Information Processing Letters, 103(3) pp. 112-118. DOI: https://doi.org/10.1016/j.ipl.2007.03.001

Copy

GRO View APA Chicago MLA Vancouver