Complexity and Real Computation
(Sprache: Englisch)
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...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
Fr. 59.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Complexity and Real Computation “
Klappentext zu „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.
Inhaltsverzeichnis zu „Complexity and Real Computation “
1 Introduction.- 2 Definitions and First Properties of Computation.- 3 Computation over a Ring.- 4 Decision Problems and Complexity over a Ring.- 5 The Class NP and NP-Complete Problems.- 6 Integer Machines.- 7 Algebraic Settings for the Problem "P ? NP?".- 8 Newton's Method.- 9 Fundamental Theorem of Algebra: Complexity Aspects.- 10 Bézout's Theorem.- 11 Condition Numbers and the Loss of Precision of Linear Equations.- 12 The Condition Number for Nonlinear Problems.- 13 The Condition Number in ?(H(d).- 14 Complexity and the Condition Number.- 15 Linear Programming.- 16 Deterministic Lower Bounds.- 17 Probabilistic Machines.- 18 Parallel Computations.- 19 Some Separations of Complexity Classes.- 20 Weak Machines.- 21 Additive Machines.- 22 Nonuniform Complexity Classes.- 23 Descriptive Complexity.- References.
Autoren-Porträt von Lenore Blum, Felipe Cucker, Michael Shub, Steve Smale
Felipe Cucker is Chair Professor of Mathematics at the City University of Hong Kong. His research covers a variety of subjects including semi-algebraic geometry, computer algebra, complexity, emergence in decentralized systems (in particular, emergence of languages and flocking), learning theory, and foundational aspects of numerical analysis. He serves on the editorial board of several journals and is Managing Editor of the journal Foundations of Computational Mathematics, published by the society of the same name.
Bibliographische Angaben
- Autoren: Lenore Blum , Felipe Cucker , Michael Shub , Steve Smale
- 2012, 1998, XVI, 453 Seiten, Masse: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 1461268737
- ISBN-13: 9781461268734
Sprache:
Englisch
Kommentar zu "Complexity and Real Computation"
0 Gebrauchte Artikel zu „Complexity and Real Computation“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Complexity and Real Computation".
Kommentar verfassen