Pages that link to "Item:Q870258"
From MaRDI portal
The following pages link to Accepting networks of splicing processors: complexity results (Q870258):
Displayed 7 items.
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Networks of splicing processors with evaluation sets as optimization problems solvers (Q2282068) (← 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 Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors (Q5217111) (← links)
- Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application (Q5217119) (← links)