Zustand: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
EUR 15,66
Anzahl: 2 verfügbar
In den WarenkorbZustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
EUR 17,09
Anzahl: 1 verfügbar
In den WarenkorbZustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780387982816.
Verlag: New York. Springer-Verlag., 1998
ISBN 10: 0387982817 ISBN 13: 9780387982816
Sprache: Englisch
Anbieter: Antiquariat Bernhardt, Kassel, Deutschland
Karton. Zustand: Sehr gut. Zust: Gutes Exemplar. 453 Seiten, mit Abbildungen, Englisch 818g.
EUR 53,67
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Zustand: New. pp. 474.
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
EUR 57,61
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 474.
hardcover. Zustand: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.
Zustand: New. pp. 474.
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 57,56
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 56,21
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
EUR 73,54
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Zustand: new.
Verlag: Springer, New York, 1998
Sprache: Englisch
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Verbandsmitglied: BOEV
Hardcover. Zustand: Sehr gut. N.Y., Springer (1998). gr.8°. 47 figs. 3 color plates. XVI, 453 p. Hardbound. Small ownership inscription on flyleaves and title, small annotation on title, otherwise in very good condition.
EUR 87,52
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
EUR 82,06
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 89,21
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 89,20
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Springer New York, Springer New York Okt 2012, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 472 pp. Englisch.
EUR 105,06
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Taschenbuch. Zustand: Neu. Complexity and Real Computation | Lenore Blum (u. a.) | Taschenbuch | xvi | Englisch | 2012 | Springer | EAN 9781461268734 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Verlag: Springer New York, Springer New York, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Verlag: Springer New York, Springer New York Okt 1997, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Buch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 472 pp. Englisch.
Verlag: Springer New York, Springer New York, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
EUR 156,84
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 453 pages. 9.75x6.50x1.25 inches. In Stock.
Verlag: Springer New York Okt 2012, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for theoretical computer science. The thesis of this book, however, is that it provides an inadequate foundation for modern scientific computation where most of the algorithms are real number algorithms. The goal of this book is to develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing. Along the way, the authors consider such fundamental problems as: \* Is the Mandelbrot set decidable \* For simple quadratic maps, is the Julia set a halting set \* What is the real complexity of Newton's method \* Is there an algorithm for deciding the knapsack problem in a ploynomial number of steps \* Is the Hilbert Nullstellensatz intractable \* Is the problem of locating a real zero of a degree four polynomial intractable \* Is linear programming tractable over the reals The book is divided into three parts: The first part provides an extensive introduction and then proves the fundamental NP-completeness theorems of Cook-Karp and their extensions to more general number fields as the real and complex numbers.The later parts of the book developa formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing. 472 pp. Englisch.
Verlag: Springer-Verlag New York Inc., 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Sprache: Englisch
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 67,70
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 748.