Librería: Majestic Books, Hounslow, Reino Unido
EUR 29,13
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620 Illus.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 33,60
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 32,66
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620.
Librería: ALLBOOKS1, Direk, SA, Australia
EUR 45,85
Cantidad disponible: 8 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.
Librería: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Alemania
EUR 37,90
Cantidad disponible: 1 disponibles
Añadir al carrito2002. 616 p. Unread book. Very good condition. Minimum traces of storage. 9783540594369 Sprache: Englisch Gewicht in Gramm: 839 Hardcover: 23.4 x 3.5 x 15.6 cm.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 60,34
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.
Librería: Celler Versandantiquariat, Eicklingen, Alemania
Miembro de asociación: GIAQ
EUR 30,00
Cantidad disponible: 1 disponibles
Añadir al carritoSpringer, Berlin, 2002. XIV, 601 pages with many graphics, hard cover, (stamp on intent)--- 1055 Gramm.
Librería: ALLBOOKS1, Direk, SA, Australia
EUR 72,92
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.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 81,43
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 80,26
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 90,30
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 84,82
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 91,85
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 Berlin Heidelberg 2002-09-19, 2002
ISBN 10: 3642082173 ISBN 13: 9783642082177
Librería: Chiron Media, Wallingford, Reino Unido
EUR 84,79
Cantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 101,83
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 91,71
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 111,03
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 102,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: preigu, Osnabrück, Alemania
EUR 73,05
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Boolean Functions and Computation Models | Evangelos Kranakis (u. a.) | Taschenbuch | xiv | Englisch | 2010 | Springer-Verlag GmbH | EAN 9783642082177 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2002
ISBN 10: 3540594361 ISBN 13: 9783540594369
Librería: moluna, Greven, Alemania
EUR 95,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. A survey of the present state of the art by internationally well-known authorsFocus on fast parallel computationIncludes numerous exercises ranging in difficultyThe two internationally renowned authors elucidate the structure of fast paralle.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2010
ISBN 10: 3642082173 ISBN 13: 9783642082177
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 80,20
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu ally halt Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable But how does one measure the intractability of computation Several ideas were proposed: A. Cobham [Cob65] raised the question of what is the right model in order to measure a 'computation step' , M. Rabin [Rab60] proposed the introduction of axioms that a complexity measure should satisfy, and C. Shannon [Sha49] suggested the boolean circuit that computes a boolean function. However, an important question remains: What is the nature of computa tion In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that . . . logics and statistics should be primarily, although not exclusively, viewed as the basic tools of 'information theory'. Also, that body of experience which has grown up around the planning, evaluating, and coding of complicated logical and mathematical automata will be the focus of much of this information theory. The most typical, but not the only, such automata are, of course, the large electronic computing machines.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 145,93
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642082173 ISBN 13: 9783642082177
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 80,20
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The two internationally renowned authors elucidate the structure of 'fast' parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers. This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of 'fast' parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems.The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory. 620 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2010
ISBN 10: 3642082173 ISBN 13: 9783642082177
Librería: moluna, Greven, Alemania
EUR 70,29
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A survey of the present state of the art by internationally well-known authorsFocus on fast parallel computationIncludes numerous exercises ranging in difficultyA survey of the present state of the art by internationally well-known authors.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 114,01
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 620 19 Illus.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 115,46
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 620.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Okt 2010, 2010
ISBN 10: 3642082173 ISBN 13: 9783642082177
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 80,20
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu ally halt Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable But how does one measure the intractability of computation Several ideas were proposed: A. Cobham [Cob65] raised the question of what is the right model in order to measure a 'computation step' , M. Rabin [Rab60] proposed the introduction of axioms that a complexity measure should satisfy, and C. Shannon [Sha49] suggested the boolean circuit that computes a boolean function. However, an important question remains: What is the nature of computa tion In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that . . . logics and statistics should be primarily, although not exclusively, viewed as the basic tools of 'information theory'. Also, that body of experience which has grown up around the planning, evaluating, and coding of complicated logical and mathematical automata will be the focus of much of this information theory. The most typical, but not the only, such automata are, of course, the large electronic computing machines.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 620 pp. Englisch.