Rahul Mehta

Learn More
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player's moves. Specifically, we show that for an n × n game board G, computing a sequence of moves to reach a particular configuration C from an initial configuration C(More)
—Interference modeling is central to the analysis of many interference limited systems. The aggregate interference due to many individual interferers is often very difficult to characterize exactly, especially when lognormal shadowing and path loss is considered. Some results are available for homogeneous sources where the individual components have the(More)
  • 1