Polynomial time bounded computations in spiking neural P systems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F13%3A%230004803" target="_blank" >RIV/47813059:19240/13:#0004803 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Polynomial time bounded computations in spiking neural P systems

Original language description

The paper introduces a formal framework for the study of computational\r\npower of spiking neural (SN) P systems. We define complexity classes of\r\nuniform families of recognizer SN P systems with and without input, in a way which\r\nis standard in P systems theory. Then we study properties of the resulting complexity\r\nclasses, extending previous results on SN P systems. We demonstrate that\r\nthe computational power of several variants of confluent SN P systems, under polynomial\r\ntimerestriction, is characterized by classes ranging from P to PSPACE.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

1210-0552

ISSN

1210-0552

e-ISSN

—

Volume of the periodical

23

Issue of the periodical within the volume

1

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

18

Pages from-to

31-48

UT code for WoS article

000317874800004

EID of the result in the Scopus database

—