Research on the complexity of Boolean Functions in non- uniform computation models is now one of the most interesting and important areas of research in theoretical computer science. It has a direct relevance to practical problems in the Computer Aided Design of digital circuits. In this book Professor Dr Wegener presents a large number of recent research results for the first time. Initially he deals with the well-known computation models (circuits and formulae), and he goes on to special types of circuits, parallel computers, and branching programs. Basic results are included as well as the most recent research results. The Complexity of Boolean Functions assumes a basic knowledge of computer science and mathematics. It deals with both efficient algorithms and lower bounds. At the end of each chapter there are exercises with varying levels of difficulty to help students using the book.

�ber die Autorin bzw. den Autor:

Ingo Wegener was an influential German computer scientist working in the field of theoretical computer science.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Librer�a on-line de libros usados

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

OASIS MEDIA BOOKS SC
CALLE TUCUMAN, NUM. 7 PLANTA 7, PUERTA C, Sevilla, 41006, Spain

Gesch�ftsbedingungen:

Librer�a on-line de libros usados

Versandinformationen:

Los gastos de env�o se calculan para env�os est�ndar.

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Zahlungsarten
akzeptiert von diesem Verk�ufer

Zu Kaufgesuchen hinzuf�gen

Verwandte Artikel zu The Complexity of Boolean Functions

The Complexity of Boolean Functions

Wegener

Gebraucht - Hardcover

Unternehmensdaten des Verk�ufers