In this paper we show that the 2-D Tucker search problem is PPA-complete. This is the usual Tucker search problem in Euclidean space as defined by Papadimitriou ...
A new complexity class BU is defined, which captures all problems that can be reduced to solving an instance of the Borsuk-Ulam problem exactly, and it is ...
Abstract: The 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker ...
The 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker for all ...
If the triangulation is exponentially large and the coloring is determined by a deterministic Turing-machine, then this problem is PPAD-complete which ...
The reduction from 2-D General Octahedral Tucker to Octahedral Tucker involves two main folding techniques, which focus to overcome separate challenges: (1) ...
The 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker for all k≥2 ...
We show that if the triangulation is exponentially large and the coloring is determined by a deterministic Turing-machine, then this problem is PPAD-complete.
Missing: PPA | Show results with:PPA
Tucker's lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1, 1,2, 2} in an antipodal way (if | z | = 1, ...
Subsequently, Aisenberg et al proved the first problem based in Euclidean space, the General 2-D Tucker, to be PPA-complete, in. [1]. Under the context of ...