We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...
This paper is an addition to the discourse surrounding interface theory and pervasive games. A buzzword by nature, the term ´interface´ needs to be investigated and redefined in...
Game studies methodologies which focus on the visual, narrative, and semiotic content of digital games overlook the way that embodied perception and physiological response contrib...
Interoperability is currently seen as one of the most significant problems facing the digital rights management (DRM) industry. In this paper we consider the problem of interoper...