[{"_id":"5394","type":"technical_report","pubrep_id":"30","status":"public","citation":{"apa":"Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002","ama":"Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","mla":"Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002."},"date_updated":"2020-07-14T23:07:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Horn, Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"title":"Improved lower bounds for request-response and finitary Streett games","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:43Z","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."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"09","year":"2009","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"day":"09","file":[{"date_created":"2018-12-12T11:53:50Z","file_name":"IST-2009-0002_IST-2009-0002.pdf","date_updated":"2020-07-14T12:46:43Z","file_size":238091,"creator":"system","checksum":"1c50a9723fbae1b2c46d18138968efb3","file_id":"5511","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"page":"11","date_created":"2018-12-12T11:39:05Z","date_published":"2009-09-09T00:00:00Z","doi":"10.15479/AT:IST-2009-0002"}]