Accepting hybrid networks of evolutionary processors

Thu, 11/29/2007 - 15:06 — ana

Title	Accepting hybrid networks of evolutionary processors
Publication Type	Journal Papers
Year of Publication	2005
Authors	Margenstern, M., Mitrana V., & Pérez-Jiménez M. J.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-26174-2
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	3384
Pages	235-246
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. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the set of languages accepted by AHNEPs in polynomial time.
URL	http://www.springerlink.com/content/tg05uxqqa4umahyj/?p=a17a498a4f064cb7b8e69859eb9721b1&pi=20
ISSN Number	0302-9743
DOI	10.1007/b136914