On the Hardness of Gray Code Problems for Combinatorial Objects

Arturo I. Merino, Namrata, Aaron Williams. On the Hardness of Gray Code Problems for Combinatorial Objects. In Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors, WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings. Volume 14549 of Lecture Notes in Computer Science, pages 103-117, Springer, 2024. [doi]

Abstract

Abstract is missing.