Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
149
click to vote
MFCS
2010
Springer
149
views
Theoretical Computer Science
»
more
MFCS 2010
»
Parity Games with Partial Information Played on Graphs of Bounded Complexity
15 years 1 months ago
Download
logic.rwth-aachen.de
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
claim paper
Read More »