complexity computer computations (17 résultats)

hardcover. Etat : Good.

X, 225 Seiten, 0306307073 Sprache: Englisch Gewicht in Gramm: 510 Groß 8°, Original-Pappband (Hardcover), Bibliotheks-Exemplar mit leichten Rückständen vom Rückenschild, Stempel auf Vorsatz, Titel, Schnitt und innen, insgesamt gutes und innen sauberes Exemplar, (library copy in good condition),

Etat : New. In.

Paperback. Etat : New.

Etat : New. pp. 240 Index.

Etat : New.

Taschenbuch. Etat : Neu. Complexity of Computer Computations | Proceedings of a symposium on the Complexity of Computer Computations, held March 2022, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM | R. Miller | Taschenbuch | x | Englisch | 2012 | Springer | EAN 9781468420036 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The Symposium on the Complexity of Computer Compu tations was held at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York, March 20-22, 1972. These Proceedings contain all papers presented at the Symposium together with a transcript of the concluding panel discussion and a comprehensive bibliography of the field. The Symposium dealt with complexity studies closely re lated to how computations are actually performed on computers. Although this area of study has not yet found an appropriate or generally accepted name, the area is recognizable by the signif icant commonality in problems, approaches, and motivations. The area can be described and delineated by examples such as the following. (1) Determining lower bounds on the number of operations or steps required for computational solutions of specific problems such as matrix and polynomial calculations, sorting and other combinatorial problems, iterative com putations, solving equations, and computer resource allocation. (2) Developing improved algorithms for the solution of such problems which provide good upper bounds on the number of required operations, along with experimental and v vi PREFACE theoretical evidence concerning the efficiency and numer ical accuracy of those algorithms. (3) Studying the effects on the efficiency of computation brought about by variations in sequencing and the intro duction of parallelism.

Paperback. Etat : Like New. Like New. book.

Hardcover/ Pappband. Etat : Gut. 225 S. Sehr guter Zustand/ very good Ex-Library. ha1086213 Sprache: Englisch Gewicht in Gramm: 600.

Etat : gut. 1972. Complexity of Computer Computations. Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center. (= The IBM Research Symposia Series). In deutscher Sprache. pages.

Etat : new. Questo è un articolo print on demand.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Symposium on the Complexity of Computer Compu tations was held at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York, March 20-22, 1972. These Proceedings contain all papers presented at the Symposium together with a transcript of the concluding panel discussion and a comprehensive bibliography of the field. The Symposium dealt with complexity studies closely re lated to how computations are actually performed on computers. Although this area of study has not yet found an appropriate or generally accepted name, the area is recognizable by the signif icant commonality in problems, approaches, and motivations. The area can be described and delineated by examples such as the following. (1) Determining lower bounds on the number of operations or steps required for computational solutions of specific problems such as matrix and polynomial calculations, sorting and other combinatorial problems, iterative com putations, solving equations, and computer resource allocation. (2) Developing improved algorithms for the solution of such problems which provide good upper bounds on the number of required operations, along with experimental and v vi PREFACE theoretical evidence concerning the efficiency and numer ical accuracy of those algorithms. (3) Studying the effects on the efficiency of computation brought about by variations in sequencing and the intro duction of parallelism. 240 pp. Englisch.

Etat : New. Print on Demand pp. 240 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam.

Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Etat : New. PRINT ON DEMAND pp. 240.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The Symposium on the Complexity of Computer Compu tations was held at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York, March 20-22, 1972. These Proceedings contain all papers presented at the Symposium together with a transcript of the concluding panel discussion and a comprehensive bibliography of the field. The Symposium dealt with complexity studies closely re lated to how computations are actually performed on computers. Although this area of study has not yet found an appropriate or generally accepted name, the area is recognizable by the signif icant commonality in problems, approaches, and motivations. The area can be described and delineated by examples such as the following. (1) Determining lower bounds on the number of operations or steps required for computational solutions of specific problems such as matrix and polynomial calculations, sorting and other combinatorial problems, iterative com putations, solving equations, and computer resource allocation. (2) Developing improved algorithms for the solution of such problems which provide good upper bounds on the number of required operations, along with experimental and v vi PREFACE theoretical evidence concerning the efficiency and numer ical accuracy of those algorithms. (3) Studying the effects on the efficiency of computation brought about by variations in sequencing and the intro duction of parallelism.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 240 pp. Englisch.