Pages that link to "Item:Q1004084"
From MaRDI portal
The following pages link to On small, reduced, and fast universal accepting networks of splicing processors (Q1004084):
Displaying 11 items.
- Accepting networks of splicing processors: complexity results (Q870258) (← 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)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- Accepting Networks of Splicing Processors with Filtered Connections (Q3608485) (← links)
- ON SMALL UNIVERSAL SPLICING SYSTEMS (Q4923288) (← links)
- Networks of Polarized Splicing Processors (Q5055983) (← links)
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size (Q5452560) (← links)
- New Computational Paradigms (Q5717054) (← links)
- Networks of splicing processors: simulations between topologies (Q6048242) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)