The complexity of solving reachability games using value and strategy iteration

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Conference article › Research › peer-review

15 Citations (Scopus)

Original language	English
Book series	Lecture Notes in Computer Science
Volume	6651
Pages (from-to)	77-90
Number of pages	14
ISSN	0302-9743
DOIs	https://doi.org/10.1007/978-3-642-20712-9_7
Publication status	Published - 2011
Event	6th International Computer Science Symposium in Russia - Skt. Petersborg, Russian Federation Duration: 14 Jun 2011 → 18 Jun 2011

Conference	6th International Computer Science Symposium in Russia
Country/Territory	Russian Federation
City	Skt. Petersborg
Period	14/06/2011 → 18/06/2011

Access to Document

@inproceedings{cabfd555c9c14e91a85897092a9fcef3,

title = "The complexity of solving reachability games using value and strategy iteration",

author = "Hansen, {Kristoffer Arnsfelt} and Miltersen, {Peter Bro} and Rasmus Ibsen-Jensen",

year = "2011",

doi = "10.1007/978-3-642-20712-9_7",

language = "English",

volume = "6651",

pages = "77--90",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

note = "6th International Computer Science Symposium in Russia ; Conference date: 14-06-2011 Through 18-06-2011",

}

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Conference article › Research › peer-review

TY - GEN

T1 - The complexity of solving reachability games using value and strategy iteration

AU - Hansen, Kristoffer Arnsfelt

AU - Miltersen, Peter Bro

AU - Ibsen-Jensen, Rasmus

PY - 2011

Y1 - 2011

U2 - 10.1007/978-3-642-20712-9_7

DO - 10.1007/978-3-642-20712-9_7

M3 - Conference article

SN - 0302-9743

VL - 6651

SP - 77

EP - 90

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 6th International Computer Science Symposium in Russia

Y2 - 14 June 2011 through 18 June 2011

ER -