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