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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
39
click to vote
BCS
2008
favorite
Email
discuss
report
184
views
Computer Science
»
more
BCS 2008
»
On the Complexity of Parity Games
14 years 9 days ago
Download
www.bcs.org
Parity games underlie the model checking problem for the modal
Arnold Beckmann, Faron Moller
Real-time Traffic
BCS 2008
|
Computer Science
|
Model Checking Problem
|
Parity Games
|
Polynomial-time Solution
|
claim paper
Related Content
»
The Descriptive Complexity of Parity Games
»
The Complexity of PartialObservation Parity Games
»
Permissive strategies from parity games to safety games
»
Timed Parity Games Complexity and Robustness
»
Precise Interval Analysis vs Parity Games
»
CliqueWidth and Parity Games
»
Settling the Complexity of Computing TwoPlayer Nash Equilibria
»
Parity Games with Partial Information Played on Graphs of Bounded Complexity
»
An Accelerated Algorithm for 3Color Parity Games with an Application to Timed Games
more »
Post Info
More Details (n/a)
Added
29 Oct 2010
Updated
29 Oct 2010
Type
Conference
Year
2008
Where
BCS
Authors
Arnold Beckmann, Faron Moller
Comments
(0)
Researcher Info
Computer Science Study Group
Computer Vision