Complexity and Real Computation
Produktnummer:
182b4f57586d5d44e3a1e0c12d0d4bba0c
| Autor: | Blum, Lenore Cucker, Felipe Shub, Michael Smale, Steve |
|---|---|
| Themengebiete: | algorithms complexity fundamental theorem linear optimization theoretical computer science |
| Veröffentlichungsdatum: | 30.10.1997 |
| EAN: | 9780387982816 |
| Sprache: | Englisch |
| Seitenzahl: | 453 |
| Produktart: | Gebunden |
| Verlag: | Springer US |
Produktinformationen "Complexity and Real Computation"
Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com putation steps required to solve a problem, as a function of the length of the input string.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen