Sciweavers

1242 search results - page 2 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
IPL
2006
117views more  IPL 2006»
15 years 1 months ago
P systems without multiplicities of symbol-objects
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
Artiom Alhazov
67
Voted
CIE
2010
Springer
15 years 6 months ago
Computational Complexity Aspects in Membrane Computing
Giancarlo Mauri, Alberto Leporati, Antonio E. Porr...
ITA
2006
15 years 1 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...
95
Voted
CCA
2009
Springer
15 years 8 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
119
Voted
JCSS
2011
95views more  JCSS 2011»
14 years 8 months ago
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Eric Allender, Michal Koucký, Detlef Ronneb...