Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The complexity of solving reachability games using value and strategy
  iteration   Two standard algorithms for approximately solving two-player zero-sum
concurrent reachability games are value iteration and strategy iteration. We
prove upper and lower bounds of 2^(m^(Theta(N))) on the worst case number of
iterations needed by both of these algorithms for providing non-trivial
approximations to the value of a game with N non-terminal positions and m
actions for each player in each position. In particular, both algorithms have
doubly-exponential complexity. Even when the game given as input has only one
non-terminal position, we prove an exponential lower bound on the worst case
number of iterations needed to provide non-trivial approximations.

19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
14
The categories of this paper are: math-ph
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
2
The categories of this paper are: math
3
The categories of this paper are: physics
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol