|
Dòng
|
Nội dung
|
|
1
|
Algorithm design with Haskell / Richard Bird, Jeremy Gibbons
London : Cambridge University Press, 2020
450 p. ; 27 cm.
Ký hiệu phân loại (DDC): 005.13
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
2
|
|
|
3
|
|
|
4
|
Bioinformatics algorithms : design and implementation in Python / Miguel P Rocha; Pedro G Ferreira
London, United Kingdom ; San Diego, CA, United States : Academic Press, an imprint of Elsevier,2018
395 pages. : illustrations ; 24 cm.
Ký hiệu phân loại (DDC): 570.285
Bioinformatics Algorithms: Design and Implementation in Python provides a comprehensive book on many of the most important bioinformatics problems, putting forward the best algorithms and showing how to implement them. The book focuses on the use of the Python programming language and its algorithms, which is quickly becoming the most popular language in the bioinformatics field. Readers will find the tools they need to improve their knowledge and skills with regard to algorithm development and implementation, and will also uncover prototypes of bioinformatics applications that demonstrate the main principles underlying real world applications.
Số bản sách:
(0)
Tài liệu số:
(1)
|
|
5
|
Computers and intractability : a guide to the theory of NP-completeness / Michael R Garey; David S Johnson
San Francisco : W.H. Freeman, 1979
x, 338 pages. : illustrations ; 23 cm.
Ký hiệu phân loại (DDC): 005.1
"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"-
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
|
|
|