Feb 12, 2024 · We provide polynomial-time reductions between three search problems from three distinct areas: the P-matrix linear complementarity problem (P-LCP), finding the ...

This also shows that two choices are enough for this problem as well. For these reductions, we consider the point-hyperplane dual of the colorful tangent.

In this paper we study three search problems from three distinct areas: the problem of solving a P-matrix linear complementarity problem (P-LCP), an algebraic ...

Jul 2, 2024 · This specifically means that generalized P-LCPs are equivalent to P-LCPs, and grid USOs are equivalent to cube USOs. These results are obtained ...

Feb 12, 2024 · This work provides polynomial-time reductions between three search problems from three distinct areas: the P-matrix linear complementarity ...

Schnider, S. Weber. Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents In Proceedings of the 51st EATCS International Colloquium on Automata, ...

Oct 7, 2024 · Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. ICALP 2024: 32:1-32:18. [i6]. view. electronic edition via DOI (open access) ...

Co-authors ; Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents. M Borzechowski, J Fearnley, S Gordon, R Savani, P Schnider, S Weber. arXiv preprint ...

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. Borzechowski, M., Fearnley, J., Gordon, S., Savani, R., Schnider, P., & Weber, S. (2024).

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents · Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon ...