The following pages link to Luca Manzoni (Q264542):
Displaying 50 items.
- Complexity of model checking for reaction systems (Q264544) (← links)
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
- A distance between populations for one-point crossover in genetic algorithms (Q418792) (← links)
- The firing squad synchronization problem on CA with multiple updating cycles (Q475400) (← links)
- Reaction systems and extremal combinatorics properties (Q496044) (← links)
- Geometric selective harmony search (Q506337) (← links)
- Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
- A toolbox for simpler active membrane algorithms (Q524283) (← links)
- Exploring semi-bent Boolean functions arising from cellular automata (Q831678) (← links)
- Ancestors, descendants, and gardens of Eden in reaction systems (Q896703) (← links)
- On the complexity of occurrence and convergence problems in reaction systems (Q1646245) (← links)
- The counting power of P systems with antimatter (Q1682865) (← links)
- Open problems in membrane computing and how not to solve them (Q1709912) (← links)
- Solving a special case of the P conjecture using dependency graphs with dissolution (Q1749169) (← links)
- A Turing machine simulation by P systems without charges (Q1982960) (← links)
- Facilitation in reaction systems (Q1982968) (← links)
- Simulating counting oracles with cooperation (Q1982984) (← links)
- Alternative space definitions for P systems with active membranes (Q1983009) (← links)
- Shallow laconic P-systems can count (Q1983024) (← links)
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles (Q2077403) (← links)
- On the dynamical behaviour of linear higher-order cellular automata and its decidability (Q2215107) (← links)
- Decidability of sensitivity and equicontinuity for linear higher-order cellular automata (Q2278265) (← links)
- Subroutines in P systems and closure properties of their complexity classes (Q2285669) (← links)
- Characterizing PSPACE with shallow non-confluent P systems (Q2299883) (← links)
- Monodirectional P systems (Q2311264) (← links)
- Solving QSAT in sublinear depth (Q2328327) (← links)
- Characterising the complexity of tissue P systems with fission rules (Q2403238) (← links)
- Complexity of the dynamics of reaction systems (Q2417853) (← links)
- Asynchronous cellular automata and dynamical properties (Q2629937) (← links)
- Tissue P Systems Can be Simulated Efficiently with Counting Oracles (Q2789138) (← links)
- Reachability in Resource-Bounded Reaction Systems (Q2798751) (← links)
- Complexity Classes for Membrane Systems: A Survey (Q2799162) (← links)
- Preimage Problems for Reaction Systems (Q2799204) (← links)
- Membrane Division, Oracles, and the Counting Hierarchy (Q2805449) (← links)
- (Q2811211) (← links)
- SIMPLE REACTION SYSTEMS AND THEIR CLASSIFICATION (Q2929628) (← links)
- Shallow Non-confluent P Systems (Q2975921) (← links)
- P Systems with Active Membranes Working in Sublinear Space (Q3454883) (← links)
- Simulating Elementary Active Membranes (Q3454898) (← links)
- Tissue P Systems with Small Cell Volume (Q4601134) (← links)
- Efficient Simulation of Reaction Systems on Graphics Processing Units (Q4601140) (← links)
- Computing Issues of Asynchronous CA (Q4902304) (← links)
- Some Formal Properties of Asynchronous Cellular Automata (Q4931236) (← links)
- The Many Roads to the Simulation of Reaction Systems (Q5114214) (← links)
- Fixed Points and Attractors of Reaction Systems (Q5175891) (← links)
- Computational Aspects of Asynchronous Cellular Automata (Q5199992) (← links)
- Constant-Space P Systems with Active Membranes (Q5259249) (← links)
- Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions (Q5276120) (← links)
- Reaction Systems Made Simple (Q5300919) (← links)
- Flattening and Simulation of Asynchronous Divisionless P Systems with Active Membranes (Q5404855) (← links)
