The following pages link to Alberto Leporati (Q243846):
Displayed 50 items.
- Asynchronous P systems with active membranes (Q418762) (← links)
- A toolbox for simpler active membrane algorithms (Q524283) (← links)
- P systems with active membranes: Trading time for space (Q537818) (← links)
- Exploring semi-bent Boolean functions arising from cellular automata (Q831678) (← links)
- Quantum conservative many-valued computing (Q835101) (← links)
- Three ``quantum'' algorithms to solve 3-SAT (Q872207) (← links)
- Solving the factorization problem with P systems (Q952209) (← links)
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources (Q974099) (← links)
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources (Q1035718) (← links)
- The counting power of P systems with antimatter (Q1682865) (← links)
- Enumerating orthogonal Latin squares generated by bipermutive cellular automata (Q1704110) (← 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)
- Cellular automata based S-boxes (Q1755184) (← links)
- Quantum conservative gates for finite-valued logics (Q1768733) (← links)
- A Turing machine simulation by P systems without charges (Q1982960) (← 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)
- Subroutines in P systems and closure properties of their complexity classes (Q2285669) (← links)
- Mutually orthogonal Latin squares based on cellular automata (Q2291667) (← links)
- Characterizing PSPACE with shallow non-confluent P systems (Q2299883) (← links)
- Monodirectional P systems (Q2311264) (← links)
- Time and space complexity of P systems -- and why they matter (Q2328315) (← links)
- Solving QSAT in sublinear depth (Q2328327) (← links)
- Characterising the complexity of tissue P systems with fission rules (Q2403238) (← links)
- Space complexity equivalence of P systems with active membranes and Turing machines (Q2440832) (← links)
- Towards a theory of conservative computing (Q2505971) (← links)
- Qubit semantics and quantum trees (Q2505983) (← links)
- Self-stabilization in membrane systems (Q2515840) (← links)
- Uniform solutions to SAT and subset sum by spiking neural P systems (Q2655486) (← links)
- Complexity aspects of polarizationless membrane systems (Q2655492) (← links)
- Tissue P Systems Can be Simulated Efficiently with Counting Oracles (Q2789138) (← links)
- Complexity Classes for Membrane Systems: A Survey (Q2799162) (← links)
- Membrane Division, Oracles, and the Counting Hierarchy (Q2805449) (← links)
- (Q2811216) (← links)
- 1-Resiliency of Bipermutive Cellular Automata Rules (Q2851304) (← links)
- Characterizing the computational power of energy-based P systems (Q2852132) (← links)
- P Systems Simulating Oracle Computations (Q2890301) (← links)
- Shallow Non-confluent P Systems (Q2975921) (← links)
- P Systems with Elementary Active Membranes: Beyond NP and coNP (Q3067497) (← links)
- <font>P</font>SYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE (Q3076598) (← links)
- P SYSTEMS WITH INPUT IN BINARY FORM (Q3379517) (← links)
- (Q3400508) (← links)
- (Q3416088) (← links)
- (Q3416095) (← links)
- P Systems with Active Membranes Working in Sublinear Space (Q3454883) (← links)
- Simulating Elementary Active Membranes (Q3454898) (← links)
- Recent complexity-theoretic results on P systems with active membranes (Q3465046) (← links)