Sciweavers

242 search results - page 35 / 49
» Zigzags in Turing Machines
Sort
View
ITA
2006
13 years 7 months ago
Complexity classes for membrane systems
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
JUCS
2007
126views more  JUCS 2007»
13 years 7 months ago
Accepting Networks of Evolutionary Processors with Filtered Connections
: In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from ...
Cezara Dragoi, Florin Manea, Victor Mitrana
IANDC
1998
64views more  IANDC 1998»
13 years 7 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
13 years 6 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
NC
2011
175views Neural Networks» more  NC 2011»
13 years 2 months ago
P systems with active membranes: trading time for space
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when wo...
Antonio E. Porreca, Alberto Leporati, Giancarlo Ma...