Computational efficiency and universality of timed P systems with membrane creation (Q521731): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6705086 / rank
 
Normal rank
Property / zbMATH Keywords
 
P system
Property / zbMATH Keywords: P system / rank
 
Normal rank
Property / zbMATH Keywords
 
membrane creation
Property / zbMATH Keywords: membrane creation / rank
 
Normal rank
Property / zbMATH Keywords
 
time-free solution
Property / zbMATH Keywords: time-free solution / rank
 
Normal rank
Property / zbMATH Keywords
 
SAT problem
Property / zbMATH Keywords: SAT problem / rank
 
Normal rank
Property / zbMATH Keywords
 
universality
Property / zbMATH Keywords: universality / rank
 
Normal rank

Revision as of 05:32, 1 July 2023

scientific article
Language Label Description Also known as
English
Computational efficiency and universality of timed P systems with membrane creation
scientific article

    Statements

    Computational efficiency and universality of timed P systems with membrane creation (English)
    0 references
    0 references
    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

    Identifiers