We show that the maximum success probability of players sharing quantum entanglement in a twoplayer game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant factors. As a corollary, the inclusion NEXP ⊆ MIP∗, first shown in [IV12] with three provers, holds with two provers only. The proof is based on a simpler, imp...

In a Slither Link puzzle, the player must draw a cycle in a planar graph, such that the number of edges incident to a set of clue faces equals the set of given clue values. We show that for a number of commonly played graph classes, the Slither Link puzzle is NP-complete.

the present research focuses on the changes of urmia lake level. for this purpose, two timescales have been considered. the trend changes of temperature, precipitation rate and quantitative values of climate type for the observational period from 1968 to 2011 (past scale) and from 2011 to 2100 (future scale) have been analyzed. general circulation model (gcm) is considered for simulating the va...