2 papers
cs.DS2026
Computational Complexity of Swish
Takashi Horiyama, Takehiro Ito, Jun Kawahara +4
Swish is a card game in which players are given cards having symbols (hoops and balls), and find a valid superposition of cards, called a "swish." Dailly, Lafourcade, and Marcadet…
cs.DS2025
Finding One Local Optimum Is Easy -- but What About Two?
Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
The class PLS (Polynomial Local Search) captures the complexity of finding a solution that is locally optimal and has proven to be an important concept in the theory of local searc…