Skip to Content

Books by Subject

Algorithms & Complexity Books

You are currently browsing 121–130 of 143 new and published books in the subject of Algorithms & Complexity — sorted by publish date from newer books to older books.

For books that are not yet published; please browse forthcoming books.

New and Published Books – Page 13

  1. Handbook of Discrete and Computational Geometry, Second Edition

    Edited by Csaba D. Toth, Joseph O'Rourke, Jacob E. Goodman

    Series: Discrete and Combinatorial Mathematics Series

    While high-quality books and journals in this field continue to proliferate, none has yet come close to matching the Handbook of Discrete and Computational Geometry, which in its first edition, quickly became the definitive reference work in its field. But with the rapid growth of the discipline...

    Published April 13th 2004 by Chapman and Hall/CRC

  2. Spanning Trees and Optimization Problems

    By Bang Ye Wu, Kun-Mao Chao

    Series: Discrete Mathematics and Its Applications

    The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field...

    Published January 27th 2004 by Chapman and Hall/CRC

  3. Computability Theory

    By S. Barry Cooper, S. Barry Cooper

    Series: Chapman Hall/CRC Mathematics Series

    Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive...

    Published November 17th 2003 by Chapman and Hall/CRC

  4. The EM Algorithm and Related Statistical Models

    Edited by Michiko Watanabe, Kazunori Yamaguchi

    Series: Statistics: A Series of Textbooks and Monographs

    Exploring the application and formulation of the EM algorithm, The EM Algorithm and Related Statistical Models offers a valuable method for constructing statistical models when only incomplete information is available, and proposes specific estimation algorithms for solutions to incomplete data...

    Published October 15th 2003 by CRC Press

  5. Multidimensional Discrete Unitary Transforms

    Representation: Partitioning, and Algorithms

    By Artyom M. Grigoryan, Sos S. Agaian

    Series: Signal Processing and Communications

    This reference presents a more efficient, flexible, and manageable approach to unitary transform calculation and examines novel concepts in the design, classification, and management of fast algorithms for different transforms in one-, two-, and multidimensional cases. Illustrating methods to...

    Published July 31st 2003 by CRC Press

  6. Grammars and Automata for String Processing

    From Mathematics and Computer Science to Biology, and Back

    Edited by Carlos Martin-Vide, Victor Mitrana

    Series: Topics in Computer Mathematics

    The conventional wisdom was that biology influenced mathematics and computer science. But a new approach has taken hold: that of transferring methods and tools from computer science to biology. The reverse trend is evident in Grammars and Automata for String Processing: From Mathematics and...

    Published January 16th 2003 by CRC Press

  7. Algorithms and Complexity

    2nd Edition

    By Herbert S. Wilf

    This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated...

    Published December 9th 2002 by A K Peters/CRC Press

  8. Mathematics of Quantum Computation

    Edited by Ranee K. Brylinski, Goong Chen

    Series: Computational Mathematics

    Among the most exciting developments in science today is the design and construction of the quantum computer. Its realization will be the result of multidisciplinary efforts, but ultimately, it is mathematics that lies at the heart of theoretical quantum computer science.Mathematics of Quantum...

    Published February 14th 2002 by Chapman and Hall/CRC

  9. Universal Algebra and Applications in Theoretical Computer Science

    By Klaus Denecke, Shelly L. Wismath

    Over the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of...

    Published January 18th 2002 by Chapman and Hall/CRC

  10. Computer Arithmetic Algorithms, Second Edition

    By Israel Koren

    This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more...

    Published November 30th 2001 by A K Peters/CRC Press