Algorithms and Theory of Computation Handbook, Volume 1 (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
988
Utgivningsdatum
2017-05-31
Upplaga
2 ed
Förlag
CRC Press
Medarbetare
Blanton, Marina
Illustratör/Fotograf
black and white 227 Illustrations 900 plus equations-PPI 606 22 Tables black and white
Illustrationer
22 Tables, black and white; 227 Illustrations, black and white
Dimensioner
254 x 178 x 50 mm
Vikt
1680 g
Antal komponenter
1
Komponenter
66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam
ISBN
9781138113930

Algorithms and Theory of Computation Handbook, Volume 1

General Concepts and Techniques

Häftad,  Engelska, 2017-05-31
1412
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many of the existing chapters, this second edition contains four new chapters that cover external memory and parameterized algorithms as well as computational number theory and algorithmic coding theory. This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics.
Visa hela texten

Passar bra ihop

  1. Algorithms and Theory of Computation Handbook, Volume 1
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 1701 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

  • Algorithms and Theory of Computation Handbook, Volume 2

    Mikhail J Atallah, Marina Blanton

    Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together t...

  • Algorithms and Theory of Computation Handbook - 2 Volume Set

    Mikhail J Atallah, Marina Blanton

    Algorithms and Theory of Computation Handbook, Second Edition? in a two volume set, provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver...

Övrig information

Mikhail J. Atallah is a distinguished professor of computer science at Purdue University. Marina Blanton is an assistant professor in the computer science and engineering department at the University of Notre Dame

Innehållsförteckning

Preface, Editors, Contributors, 1 Algorithm Design and Analysis Techniques, 2 Searching, 3 Sorting and Order Statistics, 4 Basic Data Structures, 5 Topics in Data Structures, 6 Multidimensional Data Structures for Spatial Applications, 7 Basic Graph Algorithms, 8 Advanced Combinatorial Algorithms, 9 Dynamic Graph Algorithms, 10 External-Memory Algorithms and Data Structures, 11 Average Case Analysis of Algorithms, 12 Randomized Algorithms, 13 Pattern Matching in Strings, 14 Text Data Compression Algorithms, 15 General Pattern Matching, 16 Computational Number Theory, 17 Algebraic and Numerical Algorithms, 18 Applications of FFT and Structured Matrices, 19 Basic Notions in Computational Complexity, 20 Formal Grammars and Languages, 21 Computability, 22 Complexity Classes, 23 Reducibility and Completeness, 24 Other Complexity Classes and Measures, 25 Parameterized Algorithms, 26 Computational Learning Theory, 27 Algorithmic Coding Theory, 28 Parallel Computation: Models and Complexity Issues, 29 Distributed Computing: A Glimmer of a Theory, 30 Linear Programming, 31 Integer Programming, 32 Convex Optimization, 33 Simulated Annealing Techniques, 34 Approximation Algorithms for NP-Hard Optimization Problems