Understanding PPA-completeness
From MaRDI portal
Publication:5368757
DOI10.4230/LIPIcs.CCC.2016.23zbMath1380.68192OpenAlexW2460378253MaRDI QIDQ5368757
Qi Qi, Jack Edmonds, Zhe Feng, Zhengyang Liu, Zeying Xu, Xiaotie Deng
Publication date: 10 October 2017
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CCC.2016.23
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Triangulating manifolds (57Q15) Relations of low-dimensional topology with graph theory (57M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ 2-D Tucker is PPA complete ⋮ Unnamed Item ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ A PPA parity theorem about trees in a bipartite graph
This page was built for publication: Understanding PPA-completeness
