Người báo cáo: Pham Lan Anh (HUT)
Thời gian: 9h30, thứ 5, ngày 6/3/2014
Địa điểm: Phòng 301 (hoặc 201), nhà A5, Viện Toán học, 18 Hoàng Quốc Việt, Cầu Giấy, Hà Nội
Tóm tắt: A symmetric necklace is a necklace that this necklace and its reverse are in the same equivalence class under rotation. An efficient algorithm is the one that uses only a constant amount of computation per object, in an amortized sense. Such algorithms are also said to be constant amortized time (CAT) algorithms. In this paper, we first present some characteristics of symmetric necklaces, then propose an efficient algorithm for generating them and finally count the cardinality of this object class. |
