• Sign In
  • Help
  • My Basket0
The books you love, the emails you want
Opt in by 25 May or you'll stop hearing from us
REVIEW NOW
On the Power of Small-Depth Computation - Foundations and Trends in Theoretical Computer Science (Paperback)
  • On the Power of Small-Depth Computation - Foundations and Trends in Theoretical Computer Science (Paperback)
zoom

On the Power of Small-Depth Computation - Foundations and Trends in Theoretical Computer Science (Paperback)

(author)
£55.00
Paperback 88 Pages / Published: 01/11/2009
  • Publisher out of stock

Currently unavailable to order

This product is currently unavailable.

  • This item has been added to your basket

Check Marketplace availability

The NP-completeness of SAT is a celebrated example of the power of bounded-depth computation: the core of the argument is a depth reduction establishing that any small non-deterministic circuit -- an arbitrary NP computation on an arbitrary input -- can be simulated by a small non-deterministic circuit of depth 2 with unbounded fan-in -- a SAT instance. Many other examples permeate theoretical computer science. On the Power of Small-Depth Computation discusses a selected subset of them, and includes a few unpublished proofs. On the Power of Small-Depth Computation starts with a unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0, 1}. It goes on to describe an unpublished proof that small bounded-depth circuits (AC0) have exponentially small correlation with the parity function. The proof is due to Adam Klivans and Salil Vadhan; it builds upon and simplifies previous ones. Thereafter it looks at a depth-reduction result by Leslie Valiant, the proof of which has not before appeared in full. It concludes by presenting the result by Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz that shows that, under standard complexity theoretic assumptions, many cryptographic primitives can be implemented in very restricted computational models. On the Power of Small-Depth Computation is an ideal primer for anyone with an interest in computational complexity, random structures and algorithms and theoretical computer science generally.

Publisher: now publishers Inc
ISBN: 9781601983008
Number of pages: 88
Weight: 134 g
Dimensions: 234 x 156 x 4 mm

You may also be interested in...

Discrete Mathematics
Added to basket
Computing with Quantum Cats
Added to basket
How to Pass Higher Computing Science
Added to basket
Don't Make Me Think, Revisited
Added to basket
Business Analysis Techniques
Added to basket
Artificial Intelligence: The Basics
Added to basket
The Singularity is Near
Added to basket
The Elements of Statistical Learning
Added to basket
BTEC Level 2 First IT Student Book
Added to basket
The Pattern On The Stone
Added to basket
Machine Learning
Added to basket
Geek Sublime
Added to basket
£14.99
Paperback
AQA A level Computer Science
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.