Octahedral Tucker is PPA-Complete

@article{Deng2017OctahedralTI,
  title={Octahedral Tucker is PPA-Complete},
  author={Xiaotie Deng and Zhe Feng and Rucha Kulkarni},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2017},
  volume={24},
  pages={118}
}
Octahedral Tucker (a special case of the celebrated Tucker problem) is the natural computational problem based on Octahedral Tucker’s lemma, a classical statement from algebraic topology. Like many fixed point results, this problem has been central to proving several important results from diverse fields of theoretical computer science. [20, 19, 14, 10]. Resolving the complexity of the natural computational problem associated with it was an important open question, also raised in [16, 2]. PPA… CONTINUE READING

Similar Papers

Loading similar papers…