564 search results - page 2 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
LCC
1994
13 years 9 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
DLT
2009
13 years 2 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
IANDC
2010
13 years 2 months ago
2010
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...