|
Descripción
|
|
|---|---|
| We consider three complexity classes defined on Accepting Hybrid Networks of Evolutionary Processors (AHNEP) and compare them with the classical 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 family of languages decided by AHNEPs in polynomial time. A language is in P if and only if it is decided by an AHNEP in polynomial time and space. We also show that PSPACE equals the family of languages decided by AHNEPs in polynomial length. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
THEORY OF COMPUTING SYSTEMS |
|
ISSN
|
1432-4350 |
|
Factor de impacto JCR
|
0,726 |
|
Información de impacto
|
|
|
Volumen
|
46 |
|
DOI
|
|
|
Número de revista
|
2 |
|
Desde la página
|
174 |
|
Hasta la página
|
192 |
|
Mes
|
ENERO |
|
Ranking
|
|