Title: | searching for doubly self-orthogonal latin squares |
Author: | Lu Runming
; Liu Sheng
; Zhang Jian
|
Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
Conference Name: | 17th International Conference on Principles and Practice of Constraint Programming, CP 2011
|
Conference Date: | September
|
Issued Date: | 2011
|
Conference Place: | Perugia, Italy
|
Keyword: | Constraint theory
; Data structures
|
Publish Place: | Germany
|
Indexed Type: | EI
|
ISSN: | 3029743
|
ISBN: | 9783642237850
|
Department: | (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (2) Graduate University, Chinese Academy of Sciences, China
|
Sponsorship: | Agreement Technologies (COST Action IC0801); Artificial Intelligence Journal; Association for Constraint Programming (ACP); Associazione Italiana per l'Intelligenza Artificiale (AI*IA); Comune di Assisi
|
English Abstract: | 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. |
Content Type: | 会议论文
|
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.
|
|
|