We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£59.58
It has never been this cheap. We have no record of a lower price.
£60 today · cheaper than every other day in the last 3 months
Springer Boolean Function Complexity - Algorithms and Combinatorics
We'll watch every seller, every day. One email when your price arrives.
Price History & Forecast
Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.
Last 30 days · 30 data points (no recent data)
NEW HERE?
Amazon shows you one price. We show you all of them.
Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.
WHAT'S ON THIS PAGE
when this has been cheap or pricey
where the price is heading next
all-time high & low, recent range
name your number, we'll email you
Price Distribution
Price distribution over 30 days • 1 price levels
Price Analysis
Most common price: £60 (30 days, 100.0%)
Price range: £60 - £60
Price levels: 1 different prices over 30 days
Description
Key Features
This Springer publication is part of the Algorithms and Combinatorics series, specifically volume 27.
The text provides a comprehensive description of basic lower bound arguments in Boolean circuit complexity.
Readers can study recent developments including results from the last year or two.
The book includes many open problems marked as Research Problems to aid advanced study.
Content focuses on the combinatorics of computer science and its impact on circuit complexity.
Product Specifications
- Brand
- Springer
- Format
- paperback
- ASIN
- 3642431445
- Domain
- Amazon UK
- Publication Date
- 22 February 2014
- Listed Since
- 13 February 2014
Barcode
No barcode data available
Similar Products You Might Like
Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27)
Springer
LMS: 169 Boolean Function Complexty (London Mathematical Society Lecture Note Series, Series Number 169)
Cambridge University Press
Boolean Functions: Theory, Fundamentals & Engineering Applications (Mathematics Research Developments)
Boolean Models and Methods in Mathematics, Computer Science, and Engineering: 134 (Encyclopedia of Mathematics and its Applications, Series Number 134)
Cambridge University Press
Cambridge University Press - Analysis of Boolean Functions
Cambridge University Press
Recent Findings in Boolean Techniques: Selected Papers from the 14th International Workshop on Boolean Problems
Springer
Boolean Functions: With Engineering Applications and Computer Programs
Springer
Boolean Functions for Cryptography and Coding Theory
Cambridge University Press
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Springer
Boolean Constructions in Universal Algebras: 242 (Mathematics and Its Applications, 242)
Springer
Boolean Functions in Coding Theory and Cryptography
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)
Springer
Countable Boolean Algebras and Decidability (Siberian School of Algebra and Logic)
Springer
Algorithms For Analysis, Inference, And Control Of Boolean Networks
Scientific Publishing
Problems and Exercises in Discrete Mathematics: 14 (Texts in the Mathematical Sciences, 14)
Springer
The Discrete Math Workbook: A Companion Manual Using Python (Texts in Computer Science)
Springer
Introduction to Boolean Algebras (Undergraduate Texts in Mathematics)
Springer
Digital Logic Techniques: Principles and practice Third edition (Tutorial Guides in Electronic Engineering)
CRC Press
Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis: 270 (The Springer International Series in Engineering and Computer Science, 270)
Springer
Logic Functions and Equations: Binary Models for Computer Science
Springer
Discrete Mathematics for Computer Science: An Example-Based Introduction
CRC Press
Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis: 270 (The Springer International Series in Engineering and Computer Science)
Springer
