Theory of computational complexity / Ding-Zhu Du, Ker-I Ko

Auteur principal : Du, Dingzhu, 1948-, AuteurCo-auteur : Ko, Ker-I, 1950-, AuteurType de document : MonographieCollection : Wiley-Interscience series in discrete mathematics and optimizationLangue : anglais.Pays: Etats Unis.Éditeur : New York : John Wiley, 2000Description : 491 p. : ill. ; 24 cmISBN: 0471345067.Bibliographie : Bibliogr. p. 453-473. Index.Sujet MSC : 03D15, Computability and recursion theory, Complexity of computation (including implicit computational complexity)
68Q15, Computer science - Theory of computing, Complexity classes
68W40, Algorithms in computer science, Analysis of algorithms
68Q25, Computer science - Theory of computing, Analysis of algorithms and problem complexity
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode
Monographie Monographie CMI
Salle 1 		03 DU (Browse shelf(Opens below)) Available 02101-01

Bibliogr. p. 453-473. Index

There are no comments on this title.

to post a comment.