2-D Tucker is PPA complete
Journal of Computer and System Sciences（2020）
摘要
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.
更多查看译文
关键词
Tucker lemma,NP search problems,Parity principle,PPA,TFNP
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要