The complexity of solving reachability games using value and strategy iteration

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review

Originalsprog	Engelsk
Bogserie	Lecture Notes in Computer Science
Vol/bind	6651
Sider (fra-til)	77-90
Antal sider	14
ISSN	0302-9743
DOI	https://doi.org/10.1007/978-3-642-20712-9_7
Status	Udgivet - 2011
Begivenhed	6th International Computer Science Symposium in Russia - Skt. Petersborg, Rusland Varighed: 14 jun. 2011 → 18 jun. 2011

Konference	6th International Computer Science Symposium in Russia
Land/Område	Rusland
By	Skt. Petersborg
Periode	14/06/2011 → 18/06/2011

Adgang til dokumentet

@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",

}

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 -