Pages that link to "Item:Q1772104"
From MaRDI portal
The following pages link to Hybrid networks of evolutionary processors are computationally complete (Q1772104):
Displaying 11 items.
- On the number of nodes in universal networks of evolutionary processors (Q854680) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- Biocomputing: an insight from linguistics (Q1761720) (← 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)
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954) (← links)
- About Universal Hybrid Networks of Evolutionary Processors of Small Size (Q3540094) (← links)
- Accepting Networks of Non-inserting Evolutionary Processors (Q3642956) (← links)
- (Q5016353) (← links)
- Networks of Reaction Systems (Q5217114) (← links)
