The LLL Algorithm

First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coeffici

The LLL algorithm is a polynomial-time lattice reduction algorithm, named after its inventors, Arjen Lenstra, Hendrik Lenstra and Laszlo Lovasz. The algorithm has revolutionized computational aspects

King Richard III remains one of the most infamous and recognisable monarchs in English or British history, despite only sitting on the throne for two years and fifty-eight days.

This book introduces readers to genetic algorithms (GAs) with an emphasis on making the concepts, algorithms, and applications discussed as easy to understand as possible. Further, it avoids a great d

A new advanced text/reference presenting a computational approach to discrete mathematics. It will also serve as a brief manual for the accompanying combinatorial computing programs, 'combinatorics'

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 expresse

SOUL OF THE SEA IN THE AGE OF THE ALGORITHM draws upon the fields of science, economics and business strategy to chart the future of humankind’s relationship to the ocean. The underlying principle is

Inspired by his work with companies like Ford and Coca-Cola, Madsbjerg's Sensemaking is a provocative stand against the "tyranny" of big data and an impassioned argument that human intelligence, inf

This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents

"This book is intended to be a sequel from the author's other title with Kluwer "Hyperspectral Imaging: Techniques for Spectral Detection and Classification". It contains five major parts. Part I is n

Richard Bird takes a radical approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style.