Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Original o primera edición
EUR 9,35
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Idioma: Inglés
Publicado por Springer (edition 1998), 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
EUR 9,35
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Good. 1998. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.
EUR 7,81
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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!
EUR 18,38
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: 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,24
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
EUR 19,78
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: Good. Our good condition books are generally good for reading but not for gifting or collecting. They could have imperfections such as creasing, fanning, inscriptions, margin notes, yellowing, staining on edge or cover or pages, bumps, scuffs, etc etc (sometimes multiple of these). It's a wide category that encompasses anything that isn't almost-new down to anything that is slightly better than poor. We would NOT recommend gifting Good books - these should be considered reading copies. Our books are dispatched from a Yorkshire former cotton mill. We list via barcode/ISBN so please note that the images are stock images and may not be the exact copy you receive, furthermore the details about edition and year might not be accurate as many publishers reuse the same ISBN for multiple editions and as we simply scan a barcode or enter an ISBN we do not check the validity of the edition data when listing. If you're looking for an exact edition please don't order (at least not without checking with us first, although we don't always have time to check). We aim to dispatch prompty, the service used will depend on order value and book size. We can ship to most countries, see our shipping policies. Payment is via Abe only.
EUR 52,79
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 59,83
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 58,19
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 474.
EUR 54,79
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 474.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 63,05
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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 61,59
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like new!
EUR 55,81
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 474.
EUR 71,51
Cantidad disponible: 1 disponibles
Añadir al carritoBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
EUR 58,30
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 56,72
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Idioma: Inglés
Publicado por Springer, New York, 1998
Librería: Antiquariat Renner OHG, Albstadt, Alemania
Miembro de asociación: BOEV
EUR 35,00
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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 86,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 80,35
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.
EUR 90,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 104,78
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 90,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 115,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer New York, Springer New York Okt 2012, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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 103,02
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer New York, Springer New York, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 58,55
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Idioma: Inglés
Publicado por Springer-Verlag New York Inc., US, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 134,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 1998 ed. 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.
Idioma: Inglés
Publicado por Springer New York, Springer New York Okt 1997, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 85,55
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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 147,58
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: new.
Idioma: Inglés
Publicado por Springer New York, Springer New York, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 92,22
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: 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.