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
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	538-545
会议日期	September
会议地点	Perugia, Italy
收录类别	EI
出版地	Germany
ISSN	3029743
ISBN	9783642237850
部门归属	(1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (2) Graduate University, Chinese Academy of Sciences, China
摘要	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.
关键词	Constraint Theory Data Structures
主办者	Agreement Technologies (COST Action IC0801); Artificial Intelligence Journal; Association for Constraint Programming (ACP); Associazione Italiana per l'Intelligenza Artificiale (AI*IA); Comune di Assisi
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/14235
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Lu Runming,Liu Sheng,Zhang Jian. searching for doubly self-orthogonal latin squares[C]. Germany,2011:538-545.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
searching for doubly（245KB）			开放获取	--	请求全文