Imagen del editor

On the Power of Small-Depth Computation

Emanuele Viola

0 valoraciones por Goodreads
ISBN 10: 160198300X / ISBN 13: 9781601983008
Editorial: now publishers Inc
Nuevos Condición: New Encuadernación de tapa blanda
Comprar nuevo
Precio recomendado: 65.00
Precio: EUR 91,90 Convertir moneda
Gastos de envío: EUR 3,31 A Estados Unidos de America Destinos, gastos y plazos de envío
Añadir al carrito

Ofrecido por

BuySomeBooks
Las Vegas, NV, Estados Unidos de America

Valoración 5 estrellas

Librería en AbeBooks desde: 21 de mayo de 2012

Descripción

Paperback. 86 pages. Dimensions: 9.2in. x 6.1in. x 0.2in.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 nondeterministic 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 (AC) 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. N° de ref. de la librería 9781601983008

Cantidad: > 20

Hacer una pregunta a la librería

Detalles bibliográficos

Título: On the Power of Small-Depth Computation

Editorial: now publishers Inc

Encuadernación: Paperback

Condición del libro: New

Tipo de libro: Paperback

Acerca de

Sinopsis:

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 nondeterministic 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 (AC°) 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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Descripción de la librería

BuySomeBooks is great place to get your books online. With over eight million titles available we're sure to have what you're looking for. Despite having a large selection of new books available for immediate shipment and excellent customer service, people still tell us they prefer us because of our prices.

Ver la página web de la librería

Condiciones de venta:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

BuySomeBooks is operated by Drive-On-In, Inc., a Nevada co...

Más información
Condiciones de envío:

Orders usually ship within 1-2 business days. Books are shipped from multiple locations so your order may arrive from Las Vegas,NV, Roseburg,OR, La Vergne,TN, Momence,IL, or Commerce,GA.

Todos los libros de esta librería

Métodos de pago
aceptados por la librería

Visa Mastercard American Express Carte Bleue