Algorithmes (Paperback)

Algorithmes af Donald E Knuth, ISBN 9781575866208

Se stort billede

Forfatter: Donald E Knuth

(ingen boganmeldelser)

Jeg har læst den
Jeg ejer den

Vælg antal:

Læg i kurv

Tip en ven

Link til denne side

Leveringsgaranti - bøger til tiden

Ubegrænset returret

Fri fragt, ved køb over kr. 500,-

Salgsbetingelser

Normalpris:	~~DKK 339,95~~
Din pris:	kr. 331,23
Du sparer:	DKK 8,72 (2,56%)
Leveringstid:	5-10 hverdage
Leveringspris:	kr 19,00 Gratis levering ved køb over kr 500 - Læs mere

Sprog:	Engelsk
	Se produktdetaljer (sideantal, udgivelsesdato, udgave, ISBN m.v.)

Alt om bogen:

Beskrivelse Anmeldelser

Andre bøger, der måske vil interessere dig:

Don't Make Me Think

af: Steve Krug

DKK 225,65

Agile Project Management With Scrum

af: Ken Schwaber

DKK 225,59

Designing Interactive Systems

af: Susan Turner, David Benyon & Phil Turner

DKK 410,08

Praktisk it-projektledelse

af: Stephen Biering Sørensen

DKK 498,00

Information Architecture for the World Wide Web

af: Peter Morville & Louis Rosenfeld

DKK 219,68

Microsoft Sharepoint 2007 for Dummies

af: Vanessa L Williams

DKK 140,98

Doyle Brunson's Super System

af: Doyle Brunson

DKK 292,46

Agile Software Development With Scrum

af: Ken Schwaber

DKK 419,95

Head First Html With CSS & XHTML

af: Elisabeth Freeman, Bert Bates & Eric Freeman

DKK 219,68

Excel 2007 Bible

af: John Walkenbach

DKK 225,59

Microsoft SharePoint 2010 for Dummies

af: Vanessa L Williams

DKK 169,18

Introduction to Algorithms

af: Charles E Leiserson, Clifford Stein, Ronald L Rivest & Thomas H Cormen

DKK 403,38

Code Complete

af: Steven C Mcconnell

DKK 282,01

Applying UML and Patterns

af: Craig Larman

DKK 314,98

Beskrivelser af Algorithmes

Forlagets beskrivelse: A French translation of seventeen papers by Donald E Knuth on algorithms both in the field of analysis of algorithms and in the design of new algorithms. Illustrations
Bibliotekernes beskrivelse: This book is a French translation of seventeen papers by Donald E. Knuth on algorithms both in the field of analysis of algorithms and in the design of new algorithms. They cover fundamental concepts and techniques and numerous discrete problems such as sorting, searching, data compression, theorem-proving, and cryptography, as well as methods for controlling errors in numerical computations.