Search results>Research output from IST PubRep
review
oaioai::30

Improved lower bounds for request-response and finitary Streett games

Authors
Publication date
2009
Publisher
IST Austria

Abstract

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

Similar works

Full text

This paper was published in IST PubRep.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.