7628 search results - page 148 / 1526 » Spatial P systems |
101
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
119
click to vote
IJFCS
2011
14 years 10 months ago
2011
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
134
click to vote
NGC
2002
Springer
15 years 3 months ago
2002
Springer
In the attempt to have a framework where the computation is done by communication only, we consider the biological phenomenon of trans-membrane transport of couples of chemicals (o...
CLUSTER
2009
IEEE
15 years 10 months ago
2009
IEEE
