Algorithms and Combinatorics: Advances and Frontiers

Jukna, Stasys

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.

Details

Published by: Springer

Publication Date: 2014-02-22

Format: Paperback

ISBN-13: 9783642431449

DOI: 10.1007/978-3-642-24508-4

Dimensions: 235cm x155cm

Pages: 620