Lekh vermani (31 risultati)

paperback. Condizione: Very Good. Fast Shipping - Safe and Secure 7 days a week.

hardcover. Condizione: Very Good. Legacy smart filter userdata3=general (pricing criteria).

Softcover. Condizione: Gut. 1. ed. 254 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. L07960 9780412573804 Sprache: Englisch Gewicht in Gramm: 410.

Softcover. Condizione: Gut. 265 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780412573804 Sprache: Englisch Gewicht in Gramm: 550.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9780412573804.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 264 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condizione: New.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: New. pp. 256.

Hardcover. Condizione: Brand New. 424 pages. 9.50x6.50x1.50 inches. In Stock.

Condizione: New. pp. 256.

Taschenbuch. Condizione: Neu. Neuware - Coding theory came into existence in the late 1940's and is concerned with devising efficient encoding and decoding procedures.The book is intended as a principal text for first courses in coding and algebraic coding theory, and is aimed at advanced undergraduates and recent graduates as both a course and self-study text. BCH and cyclic, Group codes, Hamming codes, polynomial as well as many other codes are introduced in this textbook. Incorporating numerous worked examples and complete logical proofs, it is an ideal introduction to the fundamental of algebraic coding.…

Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. An introduction to some of the fascinating and beautiful areas of Discrete Mathematical Structures.KlappentextThe book provides a broad introduction to some of the fascinating and beautiful areas of Discrete Mathematical Structures. .…

Condizione: New. pp. 256 This item is printed on demand.

Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing 'output' and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.…

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnIn computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.nAs an effective method, an algorithm can be .…