On the Hardness of Gray Code Problems for Combinatorial Objects

Merino, Arturo; Namrata,; Williams, Aaron

doi:10.1007/978-981-97-0566-5_9

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Hardness of Gray Code Problems for Combinatorial Objects

MPS-Authors

/persons/resource/persons294914

Merino, Arturo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dIy4F
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Merino, A., Namrata, & Williams, A. (2024). On the Hardness of Gray Code Problems for Combinatorial Objects. In R. Uehara, K. Yamanaka, & H.-C. Yen (Eds.), WALCOM: Algorithms and Computation (pp. 328-339). Berlin: Springer. doi:10.1007/978-981-97-0566-5_9.

Cite as: https://hdl.handle.net/21.11116/0000-000F-4EEB-2

Abstract

There is no abstract available