Before revision: We study the computational complexity of computing solutions for the  square-cut pizza sharing problem. In this problem, we have n mass distributions in the plane, and the task is to find a path that uses horizontal and vertical segments that splits each of the masses in half while making at most n-1 turns.
After revision: We study the computational complexity of computing solutions for the square-cut pizza sharing problems.