Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Complexity and Real Computation

Foreword by Richard M. Karp - Book w. online files / update
BuchGebunden
453 Seiten
Englisch
Springererschienen am30.10.19971997
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. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms.mehr
Verfügbare Formate
BuchGebunden
EUR85,55
BuchKartoniert, Paperback
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49

Produkt

KlappentextComputational 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. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms.
Zusammenfassung
Unique work on this core topic * Written by internationally recognised specialists in mathematics and computing * Provides the basics for numerous practical industrial applications, e.g. AI, robotics, digital cash
Details
ISBN/GTIN978-0-387-98281-6
ProduktartBuch
EinbandartGebunden
Verlag
Erscheinungsjahr1997
Erscheinungsdatum30.10.1997
Auflage1997
Seiten453 Seiten
SpracheEnglisch
Gewicht913 g
IllustrationenXVI, 453 p. With online files/update.
Artikel-Nr.10395768

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Autor

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.
Weitere Artikel von
Blum, Lenore