文章基本信息

标题：2-D Tucker is PPA complete
本地全文：下载
作者：James Aisenberg ; Maria Luisa Bonet ; Sam Buss 等
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2015
卷号：2015
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：
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.
关键词：NP Search Functions ; Tucker Lemma