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