1 citations · 1 across the 2 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Unfairly Splitting Separable Necklaces
Patrick Schnider, Linus Stalder, Simon Weber
The Necklace Splitting problem is a classical problem in combinatorics that has been intensively studied both from a combinatorial and a computational point of view. It is well-kno…
cs.CC2024
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
Michaela Borzechowski, John Fearnley, Spencer Gordon +3
We provide polynomial-time reductions between three search problems from three distinct areas: the P-matrix linear complementarity problem (P-LCP), finding the sink of a unique sin…