Edité par Tsinghua University Press, 2009
ISBN 10 : 7302190992 ISBN 13 : 9787302190998
Vendeur : liu xing, Nanjing, JS, Chine
EUR 55,61
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : New. Paperback. Pub Date: 2009 Pages: 294 Language: Chinese in Publisher: algorithm design and analysis of the content of the Tsinghua University Press follow the disciplines tutorial of Computer Science and Technology 2002 (China Computing Curricula 2002 CCC2002) knowledge system. introduce the basics of algorithm design. analysis. and by a large number of examples to explain the enumeration method. the recursive method. divide and conquer. greedy algorithms. dynamic programming. graph search alg.
Edité par Tsinghua University Press, 1991
ISBN 10 : 730212437X ISBN 13 : 9787302124375
Langue: chinois
Vendeur : liu xing, Nanjing, JS, Chine
EUR 52,41
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : New. Paperback. Pub Date: 2006 Pages: 275 Publisher: Tsinghua University Press book content to follow the disciplines tutorial of Computer Science and Technology 2002 (China Computing Curricula 2002 . referred to as CCC2002 ) knowledge systems. introduced algorithm and its design. the analysis of the basis of knowledge. and by a large number of examples to explain the enumeration method. the recursive method. divide and conquer. greedy algorithms. dynamic programming. graph search algorithm strate.
Vendeur : liu xing, Nanjing, JS, Chine
EUR 52,41
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : New. Pub Date :2006-03-01 Pages: 275 Publisher: Tsinghua University Press book content to follow the disciplines tutorial of Computer Science and Technology 2002 (ChinaComputingCurricula2002 . the knowledge system referred to as CCC2002 ). describes the algorithm and its The basics of design. analysis. and by a large number of examples to explain the enumeration method. the recursive method. divide and conquer. greedy algorithms. dynamic programming. graph search algorithm strategy. In addition. t.