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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo JC7PGM7HWO
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 20182089-n
Quantità: Più di 20 disponibili
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condizione: New. Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas. Book. Codice articolo BBS-9781468420036
Quantità: 5 disponibili
Da: Chiron Media, Wallingford, Regno Unito
PF. Condizione: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Codice articolo 6666-IUK-9781468420036
Quantità: 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781468420036
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9781468420036
Quantità: 2 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 20182089-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In English. Codice articolo ria9781468420036_new
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9781468420036
Quantità: Più di 20 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. pp. 240 Index. Codice articolo 2697851911
Quantità: 4 disponibili