Chapter of Book
Accepting Hybrid Networks of Evolutionary Processors
Author/s | Margenstern, Maurice
Mitrana, Víctor Pérez Jiménez, Mario de Jesús |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2005 |
Deposit Date | 2017-01-17 |
Published in |
|
ISBN/ISSN | 978-3-540-26174- 0302-9743 |
Abstract | We consider time complexity classes defined on accepting hybrid
networks of evolutionary processors (AHNEP) similarly to the classical
time complexity classes defined on the standard computing model
of Turing machine. ... We consider time complexity classes defined on accepting hybrid networks of evolutionary processors (AHNEP) similarly to the classical time complexity classes defined on the standard computing model of Turing machine. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the set of languages accepted by AHNEPs in polynomial time. |
Citation | Margenstern, M., Mitrana, V., y Pérez Jiménez, M.d.J. (2005). Accepting Hybrid Networks of Evolutionary Processors. En International Meeting on DNA Computing, DNA 10. Lecture Notes in Computer Science, 3384 (2005) (pp. 235-246). Berlin: Springer. |
Files | Size | Format | View | Description |
---|---|---|---|---|
chp%3A10.1007%2F11493785_21.pdf | 276.0Kb | [PDF] | View/ | |