Repositorio de producción científica de la Universidad de Sevilla

Accepting Hybrid Networks of Evolutionary Processors

 

Advanced Search
 
Opened Access Accepting Hybrid Networks of Evolutionary Processors
Cites

Show item statistics
Icon
Export to
Author: 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
Date: 2005
Published in: International Meeting on DNA Computing, DNA 10. Lecture Notes in Computer Science, 3384 (2005)
ISBN/ISSN: 978-3-540-26174-
0302-9743
Document type: Chapter of Book
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.
Size: 276.0Kb
Format: PDF

URI: http://hdl.handle.net/11441/52357

DOI: 10.1007/11493785_21

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)