- Main
- Computers - Algorithms and Data Structures
- Encyclopedia of Algorithms
Encyclopedia of Algorithms
Ming-Yang Kao (Editor)你有多喜歡這本書?
文件的質量如何?
下載本書進行質量評估
下載文件的質量如何?
This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics.
This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms.
Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code.
All entries are peer-reviewed, written by leading experts in the field―and each entry contains links to a summary of the author’s research work.
This defining reference is available in both print and online―a dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs.
This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms.
Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code.
All entries are peer-reviewed, written by leading experts in the field―and each entry contains links to a summary of the author’s research work.
This defining reference is available in both print and online―a dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs.
年:
2016
版本:
2
出版商:
Springer New York
語言:
english
頁數:
2389
ISBN 10:
1493928635
ISBN 13:
9781493928637
文件:
PDF, 48.84 MB
你的標籤:
IPFS:
CID , CID Blake2b
english, 2016
該文件將發送到您的電子郵件地址。 您最多可能需要 1-5 分鐘收到它。
該文件將通過電報信使發送給您。 您最多可能需要 1-5 分鐘收到它。
注意:確保您已將您的帳戶鏈接到 Z-Library Telegram 機器人。
該文件將發送到您的 Kindle 帳戶。 您最多可能需要 1-5 分鐘就能收到它。
請注意:您需要驗證要發送到 Kindle 的每本書。 檢查您的郵箱是否有來自 Amazon Kindle 的驗證郵件。
轉換進行中
轉換為 失敗