Order Total (1 Item Items):
Shipping Destination:
Boolean Functions Computation Models by Clote Peter (25 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (25)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (19)
- As New, Fine or Near Fine (3)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (3)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (10)
- Not Print on Demand (22)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Condition: New. pp. 620 Illus.
-
Condition: New. pp. 620.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: New. pp. 620.
-
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSSeller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
Seller rating 5 out of 5 stars
2002. 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.
-
Condition: 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.
-
601 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9783540594369 Sprache: Englisch Gewicht in Gramm: 990.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Boolean Functions and Computation Models
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSSeller: Celler Versandantiquariat, Eicklingen, Germany
Association Member: GIAQ
Seller rating 5 out of 5 stars
Springer, Berlin, 2002. XIV, 601 pages with many graphics, hard cover, (stamp on intent)--- 1055 Gramm.
-
-
-
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Condition: As New. Unread book in perfect condition.
-
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg 2002-09-19, 2002
ISBN 10: 3642082173 ISBN 13: 9783642082177
Paperback. Condition: New.
-
-
Boolean Functions and Computation Models
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Condition: New. pp. 620.
-
Boolean Functions and Computation Models
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Boolean Functions and Computation Models
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg, 2002
ISBN 10: 3540594361 ISBN 13: 9783540594369
Gebunden. Condition: 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.
-
Paperback. Condition: Like New. Like New. book.
-
Boolean Functions and Computation Models
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer, Berlin, Springer Berlin Heidelberg, Springer, 2002
ISBN 10: 3540594361 ISBN 13: 9783540594369
Buch. Condition: Neu. 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.
-
Boolean Functions and Computation Models
Book 10 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642082173 ISBN 13: 9783642082177
Condition: 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.
-
Condition: New. Print on Demand pp. 620 19 Illus.
-
Condition: New. PRINT ON DEMAND pp. 620.
