Modern Computer Arithmetic
by Richard P. Brent, Paul Zimmermann
Publisher: LORIA 2009
Number of pages: 239
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics, researchers in discrete mathematics, computer algebra, number theory, cryptography, and developers of multiple-precision libraries.
Home page url
Download or read it online for free here:
by Steven M. LaValle - Cambridge University Press
Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this book tightly integrates a vast body of literature from several fields into a coherent source for reference in applications.
by Herbert S. Wilf - AK Peters, Ltd.
An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.
by Nashat Mansour - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
by Wassim Jaziri - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.