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