Computability and Complexity

Foundations and Tools for Pursuing Scientific Applications

AvRod Downey

Häftad, Engelska, 2024

Del i serien Undergraduate Topics in Computer Science

641 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

More precisely, it examines computability theory and computational complexity theory. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space.

Produktinformation

Utgivningsdatum:2024-05-11
Mått:155 x 235 x 21 mm
Vikt:569 g
Format:Häftad
Språk:Engelska
Serie:Undergraduate Topics in Computer Science
Antal sidor:346
Förlag:Springer International Publishing AG
ISBN:9783031537431

Utforska kategorier

Mer om författaren

Rodney Downey is an Emeritus Professor at Victoria University of Wellington, NZ. He is the co-author of the Springer books, Fundamentals of Parameterized Complexity, and Algorithmic Randomness and Complexity. He has won many prizes for his work, including (twice) the Shoenfield Prize for writing, as well as the Rutherford Medal, New Zealand’s premier science award.

Recensioner i media

“The textbook achieves a balance between theoretical concepts and numerous examples and exercises, scattered efficiently throughout the chapters. Solutions and hints to the exercises are also included. The comprehensive set of references also increases the usefulness of the book. Due to its structure, it is suitable for a wide range of audiences, from students to researchers, and it represents a fundamental stepping stone towards expanding knowledge in the field.” (Irina Ioana Mohorianu, zbMATH 1555.68005, 2025)

Innehållsförteckning

Introduction.- Some Naive Set Theory.- Regular Languages and Finite Automata.- General Models of Computation.- Deeper Computability.- Computational Complexity.- NP- and PSPACE-Completeness.- Some Structural Complexity.- Parameterized Complexity.- Average Case, Smoothed Analysis, and Generic Case.- Complexity.- References.