License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CCC.2016.23
URN: urn:nbn:de:0030-drops-58310
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5831/
Go to the corresponding LIPIcs Volume Portal


Deng, Xiaotie ; Edmonds, Jack R. ; Feng, Zhe ; Liu, Zhengyang ; Qi, Qi ; Xu, Zeying

Understanding PPA-Completeness

pdf-format:
10.pdf (0.9 MB)


Abstract

We consider the problem of finding a fully colored base triangle on the 2-dimensional Möbius band under the standard boundary condition, proving it to be PPA-complete. The proof is based on a construction for the DPZP problem, that of finding a zero point under a discrete version of continuity condition. It further derives PPA-completeness for versions on the Möbius band of other related discrete fixed point type problems, and a special version of the Tucker problem, finding an edge such that if the value of one end vertex is x, the other is -x, given a special anti-symmetry boundary condition. More generally, this applies to other non-orientable spaces, including the projective plane and the Klein bottle. However, since those models have a closed boundary, we rely on a version of the PPA that states it as to find another fixed point giving a fixed point. This model also makes it presentationally simple for an extension to a high dimensional discrete fixed point problem on a non-orientable (nearly) hyper-grid with a constant side length.

BibTeX - Entry

@InProceedings{deng_et_al:LIPIcs:2016:5831,
  author =	{Xiaotie Deng and Jack R. Edmonds and Zhe Feng and Zhengyang Liu and Qi Qi and Zeying Xu},
  title =	{{Understanding PPA-Completeness}},
  booktitle =	{31st Conference on Computational Complexity (CCC 2016)},
  pages =	{23:1--23:25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-008-8},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{50},
  editor =	{Ran Raz},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5831},
  URN =		{urn:nbn:de:0030-drops-58310},
  doi =		{10.4230/LIPIcs.CCC.2016.23},
  annote =	{Keywords: Fixed Point Computation, PPA-Completeness}
}

Keywords: Fixed Point Computation, PPA-Completeness
Seminar: 31st Conference on Computational Complexity (CCC 2016)
Issue Date: 2016
Date of publication: 18.05.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI