Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)

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 rot...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algorithms Jg. 37; H. 2; S. 267 - 282
Hauptverfasser:	Cattell, Kevin, Ruskey, Frank, Sawada, Joe, Serra, Micaela, Miers, C.Robert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.11.2000 Elsevier
Schlagworte:	Exact sciences and technology Group theory Group theory and generalizations Mathematics Sciences and techniques of general use Necklace (mathematics) Irreducible polynomial Cyclic group Group theory Constant atomized time algorithm Algorithm Tournament
ISSN:	0196-6774, 1090-2678
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!