314 search results - page 1 / 63 » Complete Problems for Dynamic Complexity Classes |
LICS
2002
IEEE
13 years 10 months 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 (...
ICALP
2007
Springer
13 years 9 months ago
2007
Springer
PODS
1994
ACM
13 years 9 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 {...
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...