Reduction (Complexity)
CHF 49.40
Auf Lager
SKU
SP9U5IJHREH
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Do., 30.10.2025 und Fr., 31.10.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory and computational complexity theory, a reduction is a transformation of one problem into another problem. Depending on the transformation used this can be used to define complexity classes on a set of problems. Intuitively, problem A is reducible to problem B if solutions to B exist and give solutions to A whenever A has solutions. Thus, solving A cannot be harder than solving B. We write A B, usually with a subscript on the to indicate the type of reduction being used.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131308765
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131308765
- Format Fachbuch
- Titel Reduction (Complexity)
- Herausgeber Betascript Publishing
- Anzahl Seiten 116
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
