A deterministic subexponential algorithm for solving parity games

Martin Jurdziński; Mike Paterson; Uri Zwick

doi:10.1145/1109557.1109571

A deterministic subexponential algorithm for solving parity games

Martin Jurdziński^*, Mike Paterson, Uri Zwick

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.

Original language	English
Pages	117-123
Number of pages	7
DOIs	https://doi.org/10.1145/1109557.1109571
State	Published - 2006
Event	Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms - Miami, FL, United States Duration: 22 Jan 2006 → 24 Jan 2006

Conference

Conference	Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/Territory	United States
City	Miami, FL
Period	22/01/06 → 24/01/06

Access to Document

10.1145/1109557.1109571

Cite this

@conference{b09f9f88cfa543dfaf8f3d09b5f2d514,

title = "A deterministic subexponential algorithm for solving parity games",

abstract = "The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.",

author = "Martin Jurdzi{\'n}ski and Mike Paterson and Uri Zwick",

year = "2006",

doi = "10.1145/1109557.1109571",

language = "אנגלית",

pages = "117--123",

note = "Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 22-01-2006 Through 24-01-2006",

}

TY - CONF

T1 - A deterministic subexponential algorithm for solving parity games

AU - Jurdziński, Martin

AU - Paterson, Mike

AU - Zwick, Uri

PY - 2006

Y1 - 2006

N2 - The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.

AB - The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.

UR - http://www.scopus.com/inward/record.url?scp=33244460754&partnerID=8YFLogxK

U2 - 10.1145/1109557.1109571

DO - 10.1145/1109557.1109571

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:33244460754

SP - 117

EP - 123

T2 - Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 22 January 2006 through 24 January 2006

ER -

A deterministic subexponential algorithm for solving parity games

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this