| 题名: | searching for doubly self-orthogonal latin squares |
| 作者: | Lu Runming
; Liu Sheng
; Zhang Jian
|
| 会议文集: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| 会议名称: | 17th International Conference on Principles and Practice of Constraint Programming, CP 2011
|
| 会议日期: | September
|
| 出版日期: | 2011
|
| 会议地点: | Perugia, Italy
|
| 关键词: | Constraint theory
; Data structures
|
| 出版地: | Germany
|
| 收录类别: | EI
|
| 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
|
| 主办者: | Agreement Technologies (COST Action IC0801); Artificial Intelligence Journal; Association for Constraint Programming (ACP); Associazione Italiana per l'Intelligenza Artificiale (AI*IA); Comune di Assisi
|
| 英文摘要: | 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. |
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/14235
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| searching for doubly self-orthogonal latin squares.pdf（245KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
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.
|
|
|
