1242 search results - page 18 / 249 » A Computational Complexity Theory in Membrane Computing |
COCO
2003
Springer
14 years 17 days ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
COLING
1994
13 years 8 months ago
1994
t This paper describes how recent linguistic results in explaining Japanese short and long distance scram hling (:an be directly incorporated into an existing principles-and-parame...