دانلود کتاب Boolean Function Complexity: Advances and Frontiers

Name: Boolean Function Complexity: Advances and Frontiers
Availability: InStock
Author: Stasys Jukna (auth.)
ISBN: 3642245072,9783642245077

by Stasys Jukna (auth.)

عنوان فارسی: پیچیدگی تابع بولی: پیشرفت ها و مرزها
ناشر: Springer-Verlag Berlin Heidelberg
سال: 2012
ویرایش: 1
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 620-634
شابک: 3642245072,9783642245077
نوع فایل: PDF دانلود نرم افزار مطالعه
حجم: 3.76 مگابایت

گزارش تخلف

دانلود کتاب

افزودن خلاصه فارسی

جزییات کتاب

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.

کتاب های مرتبط

این کتاب رو مطالعه کردید؟ نظر شما چیست؟

برای ارسال نظر، لطفا وارد شوید.

نظر دهید

Adding comments has been disabled.

نظرات (0)

هنوز نظری داده نشده است. شما اولین باشید!