Pages that link to "Item:Q2379954"
From MaRDI portal
The following pages link to All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954):
Displayed 10 items.
- The role of evolutionary operations in accepting hybrid networks of evolutionary processors (Q553303) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors (Q2003446) (← links)
- On the size of computationally complete hybrid networks of evolutionary processors (Q2271455) (← links)
- ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS (Q3542873) (← links)
- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes (Q3618615) (← links)
- Accepting Networks of Non-inserting Evolutionary Processors (Q3642956) (← links)
- Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application (Q5217119) (← links)
