16 search results - page 4 / 4 » Computing the Cutwidth of Bipartite Permutation Graphs in Li... |
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 {...