Now showing items 1-2 of 2

    • AM with Multiple Merlins 

      Aaronson, Scott; Impagliazzo, Russell; Moshkovitz Aaronson, Dana Hadar (Institute of Electrical and Electronics Engineers (IEEE), 2014-06)
      We introduce and study a new model of interactive proofs: AM(k), or Arthur-Merlin with k non-communicating Merlins. Unlike with the better-known MIP, here the assumption is that each Merlin receives an independent random ...
    • The fewest clues problem 

      Demaine, Erik D; Ma, Fermi; Schvartzman, Ariel; Waingarten, Erik; Aaronson, Scott (Elsevier BV, 2018-11)
      When analyzing the computational complexity of well-known puzzles, most papers consider the algorithmic challenge of solving a given instance of (a generalized form of) the puzzle. We take a different approach by analyzing ...