- 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 MB를 초과하는 파일들의 변환 잠금을 해제하십시오Premium
파일이 귀하의 이메일로 송부 됩니다. 1-5분 소요됩니다.
1~5분 이내로 파일이 사용자님의 Telegram 계정으로 전송될 것입니다.
주의: 자신의 계정이 Z-Library Telegram 봇과 연결되어 있는지 확인하십시오.
1~5분 이내로 파일이 사용자님의 Kindle 기기로 전송될 것입니다.
비고: Kindle로 보내시는 책은 모두 확인해 보실 필요가 있습니다. 메일함에 Amazon Kindle Support로부터 확인 메일이 도착했는지 메일함을 점검해 보시기 바랍니다.
로의 변환이 실행 중입니다
로의 변환이 실패되었습니다