29908 search results - page 538 / 5982 » On the Complexity of |
204
click to vote
AAIM
2005
Springer
16 years 22 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
171
click to vote
APPROX
2005
Springer
16 years 22 days ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
119
click to vote
CIE
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...