<?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%">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%">Accepting hybrid networks of evolutionary processors</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/tg05uxqqa4umahyj/?p=a17a498a4f064cb7b8e69859eb9721b1&pi=20</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">3384</style></volume><pages><style face="normal" font="default" size="100%">235-246</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-26174-2</style></isbn><abstract><style face="normal" font="default" size="100%">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.
</style></abstract></record></records></xml>