3637 search results - page 18 / 728 » On Dynamic Bit-Probe Complexity |
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
ICNSC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Complex networks have attracted much attention from various fields of sciences and engineering over the last ten years. To reveal the dynamical mechanism of synchronization in...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
IANDC
2008
13 years 7 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
LICS
2002
IEEE
14 years 19 days ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...