The following pages link to DNA Computing (Q5494359):
Displaying 29 items.
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Complexity-preserving simulations among three variants of accepting networks of evolutionary processors (Q537856) (← links)
- The role of evolutionary operations in accepting hybrid networks of evolutionary processors (Q553303) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- Complexity results for deciding networks of evolutionary processors (Q714866) (← links)
- On the number of nodes in universal networks of evolutionary processors (Q854680) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- Networks of polarized evolutionary processors (Q903660) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Networks of picture processors as problem solvers (Q1746794) (← links)
- On the size complexity of hybrid networks of evolutionary processors (Q1763710) (← links)
- Filters defined by random contexts versus polarization in networks of evolutionary processors (Q1998878) (← links)
- Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors (Q2003446) (← links)
- A survey on computationally complete accepting and generating networks of evolutionary processors (Q2104129) (← links)
- Simulating polarization by random context filters in networks of evolutionary processors (Q2143817) (← links)
- Accepting networks of evolutionary processors with subregular filters (Q2254489) (← links)
- On the size of computationally complete hybrid networks of evolutionary processors (Q2271455) (← links)
- Polarization: a new communication protocol in networks of bio-inspired processors (Q2299886) (← links)
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size (Q2379954) (← links)
- A universal accepting hybrid network of evolutionary processors (Q2851709) (← links)
- On the recognition of context-free languages using accepting hybrid networks of evolutionary processors (Q3446590) (← 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)
- (Q4988161) (← links)
- Accepting networks of evolutionary processors with resources restricted and structure limited filters (Q5021112) (← links)
- Networks with Evolutionary Processors and Ideals and Codes as Filters (Q5217115) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)
