2-D Tucker is PPA complete

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.

Saved in:
Bibliographic Details
Published inJournal of computer and system sciences Vol. 108; pp. 92 - 103
Main Authors Aisenberg, James, Bonet, Maria Luisa, Buss, Sam
Format Journal Article Publication
LanguageEnglish
Published Elsevier Inc 01.03.2020
Subjects
Algorísmica i teoria de la complexitat
Complexitat computacional
Computational complexity
Informàtica
Informàtica teòrica
NP search problems
Parity principle
PPA
TFNP
Tucker lemma
Àrees temàtiques de la UPC
PPA
NP search problems
TFNP
Tucker lemma
Parity principle
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2019.09.002