296 search results - page 60 / 60 » Linear Parametric Model Checking of Timed Automata |
PODS
1994
ACM
13 years 8 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 {...