<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Florin Manea</style></author><author><style face="normal" font="default" size="100%">Maurice Margenstern</style></author><author><style face="normal" font="default" size="100%">Victor Mitrana</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors </style></title><secondary-title><style face="normal" font="default" size="100%">Theory of Computing Systems</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Evolution strategies; Evolutionary processor; Network of evolutionary processors; Turing machine; Computational complexity classes</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/2010</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/865688637337gu63/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer New York</style></publisher><volume><style face="normal" font="default" size="100%">46</style></volume><pages><style face="normal" font="default" size="100%">174-192</style></pages><abstract><style face="normal" font="default" size="100%">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. </style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><notes><style face="normal" font="default" size="100%">online version (http://dx.doi.org/10.1007/s00224-008-9124-z)</style></notes><custom1><style face="normal" font="default" size="100%">0.600</style></custom1><custom2><style face="normal" font="default" size="100%">133/279 - Q2</style></custom2></record></records></xml>