Computability and complexity theory

Rubriek: Textual/Printed/Reference Materials - Boek

Prijs: € 49.98

Rating: 0/5

☆

☆

☆

☆

☆

Verzending:
Uiterlijk 29 januari in huis

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.

• Bekijk alle specificaties

Taal: en

Uitvoering: Hardcover

Oorspronkelijke releasedatum: 01 juli 2001

Aantal pagina's: 194

Illustraties: Nee

Hoofdauteur: Steven Homer

Tweede Auteur: Alan L. Selman

Co Auteur: Steven Homer

Hoofduitgeverij: Springer-Verlag New York Inc.

Editie: and ed.

Extra groot lettertype: Nee

Porno: Nee

Studieboek: Ja

Verpakking breedte: 178 mm

Verpakking hoogte: 13 mm

Verpakking lengte: 241 mm

Verpakkingsgewicht: 544 g

EAN: 9780387950556

---