24 citations · 105 across the 16 of their papers we have counts for
5 papers · 1 filter
Mutually Orthogonal Latin Squares based on Cellular Automata
Luca Mariot, Maximilien Gadouleau, Enrico Formenti +1
We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local ru…
The many roads to the simulation of reaction systems
Claudio Ferretti, Alberto Leporati, Luca Manzoni +1
Reaction systems are a computational model inspired by the bio-chemical reactions that happen inside biological cells. They have been and currently are studied for their many nice…
Characterizing PSPACE with shallow non-confluent P systems
Alberto Leporati, Luca Manzoni, Giancarlo Mauri +2
In P systems with active membranes, the question of understanding the power of non-confluence within a polynomial time bound is still an open problem. It is known that, for shallow…
Solving QSAT in sublinear depth
Alberto Leporati, Luca Manzoni, Giancarlo Mauri +2
Among -complete problems, QSAT, or quantified SAT, is one of the most used to show that the class of problems solvable in polynomial time by families of a given va…
A Turing machine simulation by P systems without charges
Alberto Leporati, Luca Manzoni, Giancarlo Mauri +2
It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class by leveraging the uniformi…