316 search results - page 64 / 64 » On almost self-complementary graphs |
150
Voted
FSTTCS
2010
Springer
15 years 22 days ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...