Understanding PPA-Completeness.


http://eccc.hpi-web.de/report/2015/120
@article{DBLP:journals/eccc/DengFLQ15, author = {Xiaotie Deng and Zhe Feng and Zhengyang Liu and Qi Qi}, title = {Understanding PPA-Completeness}, journal = {Electronic Colloquium on Computational Complexity {(ECCC)}}, volume = {22}, pages = {120}, year = {2015}, url = {http://eccc.hpi-web.de/report/2015/120}, timestamp = {Tue, 14 Aug 2018 17:08:05 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DengFLQ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21