Complexity and Real Computation

Blum, Lenore,Cucker, Felipe,Shub, Michael,Smale, Steve

ISBN 10: 0387982817 / ISBN 13: 9780387982816

Editore: Springer, 1997

Riguardo questo articolo

There is a signature or handwriting on the inside front cover. Fast shipping and order satisfaction guaranteed. A portion of your purchase benefits Non-Profit Organizations, First Aid and Fire Stations!

Codice articolo 5FSZKJ000DYH

Dati bibliografici

• Titolo: Complexity and Real Computation
• Editore: Springer
• Data di pubblicazione: 1997
• Lingua: Inglese
• ISBN 10: 0387982817
• ISBN 13: 9780387982816
• Rilegatura: hardcover
• Condizione: Very Good

Descrizione articolo

Riassunto

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.

Contenuti

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.