The 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker for all k≥2. This corrects a claim in the literature that the Tucker search problem is in PPAD.
CitationAisenberg, J.; Bonet, M.; Buss, S. 2-D Tucker is PPA complete. "Journal of computer and system sciences", Març 2020, vol. 108, p. 92-103.