Computability and Complexity Foundations and Tools for Pursuing Scientific Applications /
The ideas and techniques comprised in the mathematical framework for understanding computation should form part of the standard background of a graduate in mathematics or computer science, as the issues of computability and complexity permeate modern science. This textbook/reference offers a straigh...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Korporativní autor: | |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2024.
|
| Vydání: | 1st ed. 2024. |
| Edice: | Undergraduate Topics in Computer Science,
|
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-031-53744-8 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- 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.