๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)

โœ Scribed by J. Sawada; F. Ruskey

Book ID
108421617
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
62 KB
Volume
46
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast Algorithms to Generate Necklaces, U
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
โœ Kevin Cattell; Frank Ruskey; Joe Sawada; Micaela Serra; C.Robert Miers ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB

Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an ลฝ . equivalence class of k-ary strings under rotation the cyclic group . A k-ary unlabeled necklace is an equivalence class of k-ary strings under