DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
No Place: Springer, 1998 ISBN 0-387-98281-7 Octavo (9.5 in. by 6.25 in.); 453pp.; fine hardcover; crisp; clean; bright.. No Place: Springer, 1998 ISBN 0387982817 9780387982816 [US]
Smale, Steve, Cucker, Felipe, Blum, Lenore, Shub, Michael
USD
54.96
Better World Books /ZVAB
ISBN10: 0387982817, ISBN13: 9780387982816, [publisher: Springer New York] Hardcover First Edition Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. [Mishawaka, IN, U.S.A.] [Publication Year: 1997]
Smale, Steve, Cucker, Felipe, Blum, Lenore, Shub, Michael
USD
57.90
Better World Books /Abebooks
ISBN10: 0387982817, ISBN13: 9780387982816, [publisher: Springer New York] Hardcover First Edition Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. [Mishawaka, IN, U.S.A.] [Publication Year: 1997]
ISBN10: 0387982817, ISBN13: 9780387982816, [publisher: Springer] Hardcover New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. [Irving, TX, U.S.A.] [Publication Year: 1997]
Smale Steve Cucker Felipe Blum Lenore Shub Michael
USD
76.03
Better World Books /Biblio
Springer New York. Used - Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Springer New York ISBN 0387982817 9780387982816 [US]
ISBN10: 0387982817, ISBN13: 9780387982816, [publisher: Springer New York] Hardcover 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. [Einbeck, Germany] [Publication Year: 1997]
ISBN10: 0387982817, ISBN13: 9780387982816, [publisher: Springer New York] Hardcover 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. [Einbeck, Germany] [Publication Year: 1997]
Blum, Lenore, and Cucker, Felipe, and Shub, Michael
USD
102.39
Alibris /Alibris
New York, NY Springer-Verlag New York Inc. 1997 1998 ed. Hard cover New. 453 p. XVI, 453 p. With online files/update. Intended for college/higher education audience. Intended for professional and scholarly audience.
Hardback. New. The later parts of the book 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. ISBN 0387982817 9780387982816 [GB]
Blum, Lenore, and Cucker, Felipe, and Shub, Michael
USD
116.24
Ria Christie Books via Alibris /Alibris
New York, NY Springer-Verlag New York Inc. 1997 1998 ed. Hard cover New. 453 p. XVI, 453 p. With online files/update. Intended for college/higher education audience. Intended for professional and scholarly audience.
Blum, Lenore, and Cucker, Felipe, and Shub, Michael
USD
128.51
Booksplease via Alibris /Alibris
New York, NY Springer-Verlag New York Inc. 1997 1998 ed. Hard cover New. XVI, 453 p. With online files/update. Intended for college/higher education audience.
Blum, Lenore; Cucker, Felipe; Shub, Michael; Smale, Steve
USD
141.00
GoldenWavesOfBooks /Abebooks
ISBN10: 0387982817, ISBN13: 9780387982816, [publisher: Springer] Hardcover New. Fast Shipping and good customer service [Fayetteville, TX, U.S.A.] [Publication Year: 1997]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
