Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Januar 2012
Genre:	Schulbücher
	Applications of Mathematics / B / Combinatorics / Combinatorics & graph theory / computer science / Computer science—Mathematics / Computers / Discrete Mathematics / Information and Communication, Circuits / Information theory / Mathematical theory of computation / Mathematics and Statistics / Mathematics of Computing / Maths for computer scientists / Theory of Computation mehr...
ISBN:	9783642245077
EAN-Code:	9783642245077
Verlag:	Springer EN
Einband:	Gebunden
Sprache:	English
Serie:	#27 - Algorithms and Combinatorics
Dimensionen:	H 235 mm / B 155 mm / D 39 mm
Gewicht:	1112 gr
Seiten:	620
Illustration:	XVI, 620 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.