Boolean Function Complexity (Algorithms and Combinatorics) - Jukna, Stasys

Boolean Function Complexity (Algorithms and Combinatorics)

Stasys Jukna

Yayınevi: Springer

Yayın tarihi: 01/2012

ISBN: 9783642245077

Ciltli | İngilizce | 636 Sayfa | 15,49x23,37x3,81 cm.

Tür: Matematik-İstatistik

  • Temin Süresi 49 - 63 iş günü

  • ÜYE GİRİŞİ YAPIN

    temin süresi ve fiyatını size bildirelim

  • ÜYE GİRİŞİ YAPIN

    stoklarımıza girdiğinde bilgilendirelim

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.

Boolean Function Complexity için şu an mevcudu olmayanlar

İlgili Ürünler

Bu Türde Çok Satanlar

Kredi Kartına Taksit İmkanı
  • 3 Taksit

  • 3 Taksit

  • 3 Taksit

©1996-2019 Pandora Yayın ve Kitap Hizmetleri A.Ş.

Mersis No: 0721-0430-4310-0015

Tasarım : Logo Site Tasarımı