找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 40838|回復(fù): 54
樓主
發(fā)表于 2025-3-21 17:16:01 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Classification Algorithms for Codes and Designs
編輯Petteri Kaski,Patric R.J. ?sterg?rd
視頻videohttp://file.papertrans.cn/228/227185/227185.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Classification Algorithms for Codes and Designs網(wǎng)絡(luò)公開度




書目名稱Classification Algorithms for Codes and Designs網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Classification Algorithms for Codes and Designs被引頻次




書目名稱Classification Algorithms for Codes and Designs被引頻次學(xué)科排名




書目名稱Classification Algorithms for Codes and Designs年度引用




書目名稱Classification Algorithms for Codes and Designs年度引用學(xué)科排名




書目名稱Classification Algorithms for Codes and Designs讀者反饋




書目名稱Classification Algorithms for Codes and Designs讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:27:05 | 只看該作者
Algorithms and Computation in Mathematicshttp://image.papertrans.cn/c/image/227185.jpg
板凳
發(fā)表于 2025-3-22 01:08:53 | 只看該作者
https://doi.org/10.1007/3-540-28991-7algorithms; classification; codes; combinatorics; complexity; designs
地板
發(fā)表于 2025-3-22 07:19:14 | 只看該作者
978-3-642-43250-7Springer-Verlag Berlin Heidelberg 2006
5#
發(fā)表于 2025-3-22 09:19:01 | 只看該作者
Classification Algorithms for Codes and Designs978-3-540-28991-3Series ISSN 1431-1550
6#
發(fā)表于 2025-3-22 14:33:55 | 只看該作者
7#
發(fā)表于 2025-3-22 19:31:14 | 只看該作者
8#
發(fā)表于 2025-3-22 21:36:50 | 只看該作者
9#
發(fā)表于 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
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-19 14:50
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
邢台县| 休宁县| 定结县| 合作市| 隆回县| 铜鼓县| 鱼台县| 孝昌县| 海盐县| 库尔勒市| 西乡县| 毕节市| 三台县| 精河县| 尤溪县| 社旗县| 肥城市| 马龙县| 秦皇岛市| 漠河县| 阜新| 广汉市| 达日县| 夹江县| 旅游| 三江| 基隆市| 新巴尔虎右旗| 腾冲县| 扎赉特旗| 乐安县| 武夷山市| 秦安县| 梨树县| 军事| 海晏县| 西盟| 曲麻莱县| 互助| 梅州市| 昌吉市|