Computational efficiency and universality of timed P systems with membrane creation (Q521731)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6705086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational efficiency and universality of timed P systems with membrane creation |
scientific article; zbMATH DE number 6705086 |
Statements
Computational efficiency and universality of timed P systems with membrane creation (English)
0 references
12 April 2017
0 references
P system
0 references
membrane creation
0 references
time-free solution
0 references
SAT problem
0 references
universality
0 references
0 references
0 references
0.9394714832305908
0 references
0.8675632476806641
0 references
0.8649784922599792
0 references
0.852043867111206
0 references
