800 search results - page 67 / 160 » On the Complexity of Parity Games |
COCO
2004
Springer
14 years 2 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
TCS
2008
13 years 9 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
The United States National Basketball Association (NBA) is one of the most popular sports league in the world and is well known for moving a millionary betting market that uses th...
LMCS
2007
13 years 9 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
ICIDS
2009
Springer
14 years 3 months ago
2009
Springer
We suggest harvesting the power of multiplayer design to bridge content across different media platforms and develop player-driven cross-media experiences. This paper first argues ...