Order Total (1 Item Items):
Shipping Destination:
Boolean Function Complexity Advances by Jukna Stasys (5 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (5)
- 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
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 (2)
- Not Print on Demand (5)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
- Free Shipping to United Kingdom (No further results match this refinement)
Seller Location
Seller Rating
-
Boolean Function Complexity : Advances and Frontiers
Published by Springer Berlin Heidelberg, 2014
ISBN 10: 3642431445 ISBN 13: 9783642431449
Language: English
£ 75.93
Convert currency£ 12.05 shipping from Germany to United KingdomQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this 'complexity Waterloo' that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
-
Boolean Function Complexity : Advances and Frontiers
Published by Springer Berlin Heidelberg, 2012
ISBN 10: 3642245072 ISBN 13: 9783642245077
Language: English
£ 104.40
Convert currency£ 12.05 shipping from Germany to United KingdomQuantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this 'complexity Waterloo' that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
-
Paperback. Condition: Brand New. 2012 edition. 620 pages. 9.00x6.10x1.30 inches. In Stock.
-
Paperback. Condition: Like New. Like New. book.
-
Hardcover. Condition: Like New. Like New. book.
