当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
2-D Tucker is PPA complete
Journal of Computer and System Sciences ( IF 1.1 ) Pub Date : 2019-09-26 , DOI: 10.1016/j.jcss.2019.09.002
James Aisenberg , Maria Luisa Bonet , Sam Buss

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 k2. This corrects a claim in the literature that the Tucker search problem is in PPAD.



中文翻译:

2D Tucker已完成PPA

二维塔克搜索问题显示出在多归一化的情况下,PPA很难解决。因此,它对于PPA来说是完整的。这同样适用于ķ -D塔克所有ķ2。这更正了文献中关于Tucker搜索问题在PPAD中的说法。

更新日期:2019-09-26
down
wechat
bug