Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27) - Image 1

£63.14

Springer Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27)

Name: Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27)
Brand: Springer
Price: 63.14 GBP
Availability: InStock

Computer Science

Price History & Forecast

Last 1 days • 1 data points (No recent data available)

Historical

Generating forecast...

Not enough data points to display chart (need at least 2 points)

Price Distribution

Price distribution over 1 days • 1 price levels

Days at Price

Price Analysis

Most common price: £63 (1 days, 100.0%)

Price range: £63 - £63

Price levels: 1 different prices over 1 days

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642431445
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Publication Date: 22 February 2014
Listed Since: 13 February 2014

Barcode

No barcode data available

Springer Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis: 270 (The Springer International Series in Engineering and Computer Science, 270)

Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)

Analysis of Boolean Functions

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Boolean Functions: With Engineering Applications and Computer Programs

Boolean Functions and Their Applications in Cryptography: 0 (Advances in Computer Science and Technology)

Boolean Functions: Theory, Fundamentals & Engineering Applications (Mathematics Research Developments)

Boolean Functions for Cryptography and Coding Theory

Advanced Boolean Techniques: Selected Papers from the 13th International Workshop on Boolean Problems

Lower Bounds in Communication Complexity (Foundations and Trends (R) in Theoretical Computer Science)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Recent Findings in Boolean Techniques: Selected Papers from the 14th International Workshop on Boolean Problems

Complexity Lower Bounds using Linear Algebra (Foundations and Trends (R) in Theoretical Computer Science)

Complexity and Real Computation

Computational Complexity: A Conceptual Perspective

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)

Computational Complexity: A Modern Approach

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Reversible Logic Synthesis: From Fundamentals to Quantum Computing

Springer - Representations of Discrete Functions - Academic Book