Afficher la notice abrégée

dc.contributor.authorSipser, Michael
dc.date.accessioned2015-09-02T00:38:01Z
dc.date.available2015-09-02T00:38:01Z
dc.date.issued2006
dc.identifier.citationAustralia : Thomson Course Technology, 2006en_US
dc.identifier.isbn0-534-95097-3
dc.identifier.urihttp://hdl.handle.net/123456789/572
dc.description.abstractThis highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.en_US
dc.language.isoenen_US
dc.publisherThomson Course Technologyen_US
dc.subjectMachine theoryen_US
dc.subjectComputational complexityen_US
dc.titleIntroduction to the theory of computationen_US
dc.typeBooken_US


Fichier(s) constituant ce document

Thumbnail

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée