- 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
Четете Онлайн
- Изтегляне
- pdf 48.84 MB Current page
- Checking other formats...
- Преобразуване в
- Деблокирайте конвертирането на файлове, по-големи от 8 MBPremium
Искате ли да добавите книжарница? Свържете се с нас на support@z-lib.do
Файлът ще бъде изпратен на вашия имейл адрес. Може да отнеме до 1-5 минути, преди да го получите.
В рамките на 1-5 минути файлът ще бъде доставен във вашия акаунт в Telegram.
Внимание: Уверете се, че сте свързали акаунта си с бота Z-Library Telegram.
В рамките на 1-5 минути файлът ще бъде доставен на вашето Kindle устройство.
Моля, обърнете внимание: трябва да потвърдите всяка книга, която искате да изпратите на вашия Kindle. Проверете пощенската си кутия за имейла за потвърждение от Amazon Kindle.
Преобразуването в се извършва
Преобразуването в е неуспешно
Предимства на премиум статус
- Изпращане на електронни четци
- Увеличен лимит за изтегляне
- Конвертиране на файлове
- Още резултати от търсенето
- Други предимства