[{"file":[{"file_name":"IST-2009-0002_IST-2009-0002.pdf","date_created":"2018-12-12T11:53:50Z","file_size":238091,"creator":"system","relation":"main_file","content_type":"application/pdf","access_level":"open_access","open_access":1,"file_id":"5511","date_updated":"2018-12-12T11:53:50Z"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>.","ama":"Chatterjee K, Henzinger TA, Horn F. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria, 2009.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p."},"publication_status":"published","type":"technical_report","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian","full_name":"Horn, Florian"}],"oa":1,"publisher":"IST Austria","day":"09","year":"2009","date_created":"2018-12-12T11:39:05Z","language":[{"iso":"eng"}],"oa_version":"Published Version","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Improved lower bounds for request-response and finitary Streett games","date_updated":"2019-08-02T12:38:44Z","month":"09","abstract":[{"lang":"eng","text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players."}],"_id":"5394","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.15479/AT:IST-2009-0002","status":"public","date_published":"2009-09-09T00:00:00Z","file_date_updated":"2018-12-12T11:53:50Z","page":"11","ddc":["004"],"pubrep_id":"30","alternative_title":["IST Austria Technical Report"],"accept":"1","publication_identifier":{"issn":["2664-1690"]}}]