searching for doubly self-orthogonal latin squares

	searching for doubly self-orthogonal latin squares
	Lu Runming ; Liu Sheng ; Zhang Jian
	2011
会议名称	17th International Conference on Principles and Practice of Constraint Programming, CP 2011
会议日期	September
会议地点	Perugia, Italy
关键词	Constraint theory Data structures
页码	538-545
英文摘要	A Doubly Self Orthogonal Latin Square (DSOLS) is a Latin square which is orthogonal to its transpose to the diagonal and its transpose to the back diagonal. It is challenging to find a non-trivial DSOLS. For the orders n = 2 (mod 4), the existence of DSOLS(n) is unknown except for n = 2, 6. We propose an efficient approach and data structure based on a set system and exact cover, with which we obtained a new result, i.e., the non-existence of DSOLS(10). © 2011 Springer-Verlag.
收录类别	EI
会议主办者	Agreement Technologies (COST Action IC0801); Artificial Intelligence Journal; Association for Constraint Programming (ACP); Associazione Italiana per l'Intelligenza Artificiale (AI*IA); Comune di Assisi
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议录出版地	Germany
ISSN号	3029743
ISBN号	9783642237850
内容类型	会议论文
源URL	[http://124.16.136.157/handle/311060/14235]
专题	软件研究所_计算机科学国家重点实验室 _会议论文
推荐引用方式 GB/T 7714	Lu Runming,Liu Sheng,Zhang Jian. searching for doubly self-orthogonal latin squares[C]. 见:17th International Conference on Principles and Practice of Constraint Programming, CP 2011. Perugia, Italy. September.