Idioma: Inglés
Publicado por UBS Publishers' Distributors, 2008
ISBN 10: 8174766103 ISBN 13: 9788174766106
Librería: Ageless Pages, Cottonwood, AZ, Estados Unidos de America
EUR 4,39
Cantidad disponible: 1 disponibles
Añadir al carritoTrade Paperback. Condición: Very Good. Slight edgewear. Munshi Premchand's stories have a moral dimension. Behind the interplay of greed, lust, ambition and sadism, there is a latent moral message that goodness and truth shall ultimately prevail.
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
EUR 5,95
Cantidad disponible: 1 disponibles
Añadir al carritoBroschiert. Condición: Gut. 219 Seiten; Das Buch ist ordentlich erhalten und kann altersbedingte Gebrauchsspuren aufweisen. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 345.
EUR 28,80
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind.
EUR 14,34
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 1st edition. 78 pages. 8.00x5.00x0.20 inches. In Stock.
EUR 50,50
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 51,66
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 54,01
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 54,05
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 66,38
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 66,41
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 66,58
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Idioma: Inglés
Publicado por Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 65,73
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 210.
EUR 50,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 69,48
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
EUR 70,34
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Idioma: Inglés
Publicado por Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: Majestic Books, Hounslow, Reino Unido
EUR 63,21
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 210.
EUR 55,34
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 54,86
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Idioma: Inglés
Publicado por Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 63,18
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 210.
EUR 80,01
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 210 pages. 9.45x6.69x0.47 inches. In Stock.
EUR 51,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: UK BOOKS STORE, London, LONDO, Reino Unido
EUR 119,14
Cantidad disponible: 3 disponibles
Añadir al carritoPaperback. Condición: New. Brand New ! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
EUR 50,64
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: moluna, Greven, Alemania
EUR 60,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Dr. Mangey Ram received the Ph.D. degree major in Mathematics and minor in Computer Science from G. B. Pant University of Agriculture and Technology, Pantnagar, India. He has been a Faculty Member for around ten years and has taught several core courses.