找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Classification Algorithms for Codes and Designs; Petteri Kaski,Patric R.J. Östergård Book 2006 Springer-Verlag Berlin Heidelberg 2006 algo

[复制链接]
查看: 40753|回复: 54
发表于 2025-3-21 17:16:01 | 显示全部楼层 |阅读模式
书目名称Classification Algorithms for Codes and Designs
编辑Petteri Kaski,Patric R.J. Östergård
视频video
概述Excellent interdisciplinary monograph on highly applications relevant topic.Provides the first comprehensive reference on combinatorial classification algorithms.Addresses both the general theory and
丛书名称Algorithms and Computation in Mathematics
图书封面Titlebook: Classification Algorithms for Codes and Designs;  Petteri Kaski,Patric R.J. Östergård Book 2006 Springer-Verlag Berlin Heidelberg 2006 algo
描述A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial ar
出版日期Book 2006
关键词algorithms; classification; codes; combinatorics; complexity; designs
版次1
doihttps://doi.org/10.1007/3-540-28991-7
isbn_softcover978-3-642-43250-7
isbn_ebook978-3-540-28991-3Series ISSN 1431-1550
issn_series 1431-1550
copyrightSpringer-Verlag Berlin Heidelberg 2006
The information of publication is updating

书目名称Classification Algorithms for Codes and Designs影响因子(影响力)




书目名称Classification Algorithms for Codes and Designs影响因子(影响力)学科排名




书目名称Classification Algorithms for Codes and Designs网络公开度




书目名称Classification Algorithms for Codes and Designs网络公开度学科排名




书目名称Classification Algorithms for Codes and Designs被引频次




书目名称Classification Algorithms for Codes and Designs被引频次学科排名




书目名称Classification Algorithms for Codes and Designs年度引用




书目名称Classification Algorithms for Codes and Designs年度引用学科排名




书目名称Classification Algorithms for Codes and Designs读者反馈




书目名称Classification Algorithms for Codes and Designs读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:27:05 | 显示全部楼层
Algorithms and Computation in Mathematicshttp://image.papertrans.cn/c/image/227185.jpg
发表于 2025-3-22 01:08:53 | 显示全部楼层
https://doi.org/10.1007/3-540-28991-7algorithms; classification; codes; combinatorics; complexity; designs
发表于 2025-3-22 07:19:14 | 显示全部楼层
978-3-642-43250-7Springer-Verlag Berlin Heidelberg 2006
发表于 2025-3-22 09:19:01 | 显示全部楼层
Classification Algorithms for Codes and Designs978-3-540-28991-3Series ISSN 1431-1550
发表于 2025-3-22 14:33:55 | 显示全部楼层
发表于 2025-3-22 19:31:14 | 显示全部楼层
发表于 2025-3-22 21:36:50 | 显示全部楼层
发表于 2025-3-23 05:16:26 | 显示全部楼层
Research in Psychiatry as a Career problems are discussed in this chapter. The reader who is not interested in implementational details of classification algorithms may well skip this chapter and assume that there is a “black box” that takes care of these tasks. Those who wish to implement classification algorithms, however, should
发表于 2025-3-23 09:21:34 | 显示全部楼层
Stephen D. Samuelson,George Winokuralanced incomplete block designs (BIBDs) – that is, 2-designs – are considered in Sect. 6.1, .-designs with . ≥ 3 in Sect. 6.2, and resolutions of designs in Sect. 6.3. In the discussion of resolutions of designs, the main focus is on resolutions of BIBDs. Extensive tables of classification results
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 00:19
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表