On the computational complexity of spiking neural P systems (Q609034): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2397533176 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0912.0928 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counter machines and counter languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5480659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small universal register machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Numerical NP-Complete Problems with Spiking Neural P Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3601859 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:19, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computational complexity of spiking neural P systems |
scientific article |
Statements
On the computational complexity of spiking neural P systems (English)
0 references
30 November 2010
0 references
spiking neural P system
0 references
small universal spiking neural P system
0 references
time efficient spiking neural P system
0 references
computational complexity
0 references
linear time
0 references
0 references