UCSY's Research Repository

Analyzing, Visualizing, and Searching for small size Balanced sets

Show simple item record

dc.contributor.author Cuong, Nguyen Phu
dc.contributor.author Nedev, Zhivko
dc.contributor.author Tin, Duong Trung
dc.contributor.author Tu, Le Anh
dc.date.accessioned 2019-07-11T03:56:34Z
dc.date.available 2019-07-11T03:56:34Z
dc.date.issued 2013-02-26
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/701
dc.description.abstract We describe the design and implementation of a computer application that can search for a small size balanced set modulo p, with p prime. Additionally, the application can”analyze” and ”visualize” any given balanced set to show graphically the dependancies between the elements of the set. A nonempty set S of residues modulo N is balanced if for each x ∈ S, there is a d with 0 <d ≤ N/2 such that x ± d mod N both lie in S; we use α(N) to denote the minimum cardinality of a balanced set modulo N. Small size balanced sets are needed for a winning strategy in the Vector game which was introduced together with balanced sets in [5] . en_US
dc.language.iso en en_US
dc.publisher Eleventh International Conference On Computer Applications (ICCA 2013) en_US
dc.title Analyzing, Visualizing, and Searching for small size Balanced sets en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account