|
Exponential examples of solving parity games
V. N. Lebedev Volgograd State University
Abstract:
This paper is devoted to solving certain problems on the computational complexity of deciding the winner in cyclic games. The main result is the proof of the fact that the nondeterministic potential transformation algorithm designed for solving parity games is exponential in terms of computation time.
Key words:
cyclic game, potential transformations, computational complexity, deciding the winner in cyclic games.
Received: 14.03.2014 Revised: 25.09.2015
Citation:
V. N. Lebedev, “Exponential examples of solving parity games”, Zh. Vychisl. Mat. Mat. Fiz., 56:4 (2016), 694–703; Comput. Math. Math. Phys., 56:4 (2016), 688–697
Linking options:
https://www.mathnet.ru/eng/zvmmf10373 https://www.mathnet.ru/eng/zvmmf/v56/i4/p694
|
|