Understanding PPA-Completeness.
https://doi.org/10.4230/LIPIcs.CCC.2016.23
@inproceedings{DBLP:conf/coco/DengEFLQX16,
author = {Xiaotie Deng and
Jack R. Edmonds and
Zhe Feng and
Zhengyang Liu and
Qi Qi and
Zeying Xu},
editor = {Ran Raz},
title = {Understanding PPA-Completeness},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {23:1--23:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.23},
doi = {10.4230/LIPIcs.CCC.2016.23},
timestamp = {Fri, 27 Mar 2020 08:56:53 +0100},
biburl = {https://dblp.org/rec/conf/coco/DengEFLQX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签