EUR 50,57
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 54,05
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
EUR 51,71
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 54,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
EUR 66,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Lingua: Inglese
Editore: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 210.
EUR 51,11
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Lingua: Inglese
Editore: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Da: Majestic Books, Hounslow, Regno Unito
EUR 62,30
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 210.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
EUR 67,53
Quantità: 15 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,64
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 55,71
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 55,39
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Lingua: Inglese
Editore: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 63,18
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 210.
EUR 72,69
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new.
EUR 80,79
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 210 pages. 9.45x6.69x0.47 inches. In Stock.
EUR 52,17
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Condizione: New. 1st edition NO-PA16APR2015-KAP.
EUR 102,51
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2021. Paperback. . . . . .
Da: Majestic Books, Hounslow, Regno Unito
EUR 112,03
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
EUR 60,87
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
EUR 51,10
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 113,78
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
EUR 138,18
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. Algorithms are ubiquitous in the contemporary technological world, and they ultimately consist of finite sequences of instructions used to accomplish tasks with necessary input values. This book analyses the top performing algorithms in areas as diverse as Big Data, Artificial Intelligence, Optimization Techniques and Cloud and Cyber Security Systems in order to explore their power and limitations.
EUR 128,91
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.