4 citations · 4 across the 1 of their papers we have counts for
3 papers
cs.CC2019
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…
cs.CC2019★ 4 cited
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…
cs.CC2019
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…