Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Space Hierarchy Theorem
CHF 43.15
Auf Lager
SKU
2Q1JFI4AV4F
1 Verfügbar 
Geliefert zwischen Do., 22.01.2026 und Fr., 23.01.2026
Details
High Quality Content by WIKIPEDIA articles! In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For example, a deterministic Turing machine can solve more decision problems in space n log n than in space n. The somewhat weaker analogous theorems for time are the time hierarchy theorems. The foundation for the hierarchy theorems lies in the intuition that with either more time or more space comes the ability to compute more functions (or decide more languages). The hierarchy theorems are used to demonstrate that the time and space complexity classes form a hierarchy where classes with tighter bounds contain fewer languages than those with more relaxed bounds. Here we define and prove the space hierarchy theorem. The space hierarchy theorems rely on the concept of space-constructible functions.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131196027
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131196027
- Format Fachbuch
- Titel Space Hierarchy Theorem
- Herausgeber Betascript Publishing
- Anzahl Seiten 92
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
