Get Free Shipping on orders over $79
Boolean Function Complexity : Advances and Frontiers - Stasys Jukna

Boolean Function Complexity

Advances and Frontiers

By: Stasys Jukna

eText | 6 January 2012

At a Glance

eText


$129.00

or 4 interest-free payments of $32.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

More in Applied Mathematics

Markov Chains : Theory and Applications - C.R. Rao

eBOOK

RRP $359.04

$323.99

10%
OFF
Pi the Laws of Duality - G. Neal

eBOOK

Grape Explications - Neal D. Hulkower

eBOOK

RRP $18.69

$17.99

Discrete Mathematics - Julian Ting

eBOOK

Mathematics for Engineers - Ritu Shrivastava

eBOOK