Jurdzinski, Marcin, Paterson, Michael S. and Zwick, Uri (2006) A deterministic subexponential algorithm for solving parity games. In: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, Jan 2006. Published in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 117-123.

Full text not available from this repository.

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.

Item Type:	Conference Item (Paper)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics
Divisions:	Faculty of Science > Computer Science
Journal or Publication Title:	Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher:	SIAM
ISBN:	978-0-89871-605-4
ISSN:	9780898716054
Official Date:	2006
Number of Pages:	7
Page Range:	pp. 117-123
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Conference Paper Type:	Paper
Title of Event:	17th ACM-SIAM Symposium on Discrete Algorithms
Type of Event:	Other
Location of Event:	Miami, FL
Date(s) of Event:	Jan 2006
URI:	http://wrap.warwick.ac.uk/id/eprint/5246

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item