Navigation

Informationsteknologi: generelt

Computability and Complexity

Udgivet af MIT Press Ltd

Bogdetaljer

  • Indbundet
  • 416 sider
  • Engelsk
ISBN 9780262048620
Om denne bog

A clear, comprehensive, and rigorous introduction to the theory of computation.What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen cover…

Se alle bogdetaljer →
Prissammenligning

Ingen boghandelspriser listet endnu

Denne titel er i vores bogkatalog. Butikstilbud vises her, når de er tilgængelige.

Betroet sælger:

Ingen boghandelstilbud lige nu.

Søg efter ISBN
Opdateret i dag

Boghandelspriser

Boghandel Titel Format ISBN Pris Lagerstatus Levering

Ingen boghandelstilbud endnu

Vi har titlen i kataloget. Priser vises her, når boghandlere lister den.

0.0
0 anmeldelser
5
0
4
0
3
0
2
0
1
0
0%
Anbefaler
0
Verificeret
Alle anmeldelser (0)

Ingen anmeldelser endnu

Skriv en anmeldelse

Valgfri - Kun brugt til verifikation
0 / 5000 tegn
Bogdetaljer
Forfatter Hubie Chen
Forlag MIT Press Ltd
Kategori Informationsteknologi: generelt
ISBN-13 9780262048620
EAN 9780262048620
Format Indbundet
Sprog Engelsk
sider 416
Produktbeskrivelse
A clear, comprehensive, and rigorous introduction to the theory of computation.What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbooks accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.Extensive exercises and diagrams enhance streamlined, student-friendly presentation of mathematically rigorous materialIncludes thorough treatment of automata theory, computability theory, and complexity theoryincluding the P versus NP question and the theory of NP-completenessSuitable for undergraduate and graduate students, researchers, and professionals

Prishistorik

Indlæser prishistorik...

Få prisalarm

Bliv underrettet, når prisen falder til dit ønskede beløb.