找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Designs 2002; Further Computationa W. D. Wallis Book 2003Latest edition Springer Science+Business Media New York 2003 algorithms.computer.c

[复制链接]
查看: 35033|回复: 53
发表于 2025-3-21 18:44:33 | 显示全部楼层 |阅读模式
书目名称Designs 2002
副标题Further Computationa
编辑W. D. Wallis
视频video
丛书名称Mathematics and Its Applications
图书封面Titlebook: Designs 2002; Further Computationa W. D. Wallis Book 2003Latest edition Springer Science+Business Media New York 2003 algorithms.computer.c
描述This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re­ lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec­ trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "sta
出版日期Book 2003Latest edition
关键词algorithms; computer; construction; latin square; Notation; sets; combinatorics
版次2
doihttps://doi.org/10.1007/978-1-4613-0245-2
isbn_softcover978-1-4613-7958-4
isbn_ebook978-1-4613-0245-2
copyrightSpringer Science+Business Media New York 2003
The information of publication is updating

书目名称Designs 2002影响因子(影响力)




书目名称Designs 2002影响因子(影响力)学科排名




书目名称Designs 2002网络公开度




书目名称Designs 2002网络公开度学科排名




书目名称Designs 2002被引频次




书目名称Designs 2002被引频次学科排名




书目名称Designs 2002年度引用




书目名称Designs 2002年度引用学科排名




书目名称Designs 2002读者反馈




书目名称Designs 2002读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:30:35 | 显示全部楼层
978-1-4613-7958-4Springer Science+Business Media New York 2003
发表于 2025-3-22 01:02:21 | 显示全部楼层
发表于 2025-3-22 06:34:58 | 显示全部楼层
发表于 2025-3-22 10:52:18 | 显示全部楼层
发表于 2025-3-22 12:52:32 | 显示全部楼层
https://doi.org/10.1007/978-3-322-90425-6in one system fail to do so in the other. We define the quantity . (.) as the size of a maximum collection of pairwise orthogonal STS of order .. Special starters in the finite fields are used to improve the best known lower bounds on . (.) for prime-powers . ≡ 1 (mod 6), . < 500. Additionally, hill
发表于 2025-3-22 18:44:41 | 显示全部楼层
https://doi.org/10.1007/978-3-322-90425-6 the same parameters, two questions arise naturally:.Here we consider triple systems and latin squares. The first question leads to the ideas of a . in a triple system and of a . in a latin square. The second question leads to the ideas of a ., in particular a . defining set, in a triple system and
发表于 2025-3-23 00:07:46 | 显示全部楼层
发表于 2025-3-23 04:52:44 | 显示全部楼层
发表于 2025-3-23 08:07:14 | 显示全部楼层
https://doi.org/10.1007/978-3-322-90425-6what balanced .-ary designs can be used in this construction. We settle several open existence cases for BTDs (including both suitable and unsuitable designs for our construction), and provide a number of suitable B.Ds.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-4-28 08:32
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表