The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
5 Angebote vergleichen
Bester Preis: € 31,14 (vom 16.10.2016)1
The Complexity of Boolean Functions (1991)
EN HC NWISBN: 9780471915553 bzw. 0471915556, in Englisch, John Wiley And Sons Ltd, gebundenes Buch, neu.
Lieferung aus: Niederlande, 5-10 werkdagen.
bol.com.
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... 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.Taal: Engels;Oorspronkelijke titel: The Complexity of Boolean Functions;Afmetingen: 33x239x162 mm;Gewicht: 838,00 gram;Verschijningsdatum: januari 1991;ISBN10: 0471915556;ISBN13: 9780471915553; Engelstalig | Hardcover | 1991.
bol.com.
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... 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.Taal: Engels;Oorspronkelijke titel: The Complexity of Boolean Functions;Afmetingen: 33x239x162 mm;Gewicht: 838,00 gram;Verschijningsdatum: januari 1991;ISBN10: 0471915556;ISBN13: 9780471915553; Engelstalig | Hardcover | 1991.
2
Symbolbild
The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science) (1991)
EN HCISBN: 9780471915553 bzw. 0471915556, in Englisch, John Wiley & Sons, gebundenes Buch.
Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Zubal Books.
John Wiley & Sons, 1991. *Price HAS BEEN temporarily reduced until Monday, Oct. 17. Order now for BEST SAVINGS* 457 pp., hardcover, vert minor library markings else text clean & binding tight.
Von Händler/Antiquariat, Zubal Books.
John Wiley & Sons, 1991. *Price HAS BEEN temporarily reduced until Monday, Oct. 17. Order now for BEST SAVINGS* 457 pp., hardcover, vert minor library markings else text clean & binding tight.
3
Symbolbild
The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
EN USISBN: 9780471915553 bzw. 0471915556, in Englisch, Wiley, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Wonder Book.
Wiley. Used - Very Good. Very Good condition. Owner's name on endpage.
Von Händler/Antiquariat, Wonder Book.
Wiley. Used - Very Good. Very Good condition. Owner's name on endpage.
4
Symbolbild
The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
EN HC USISBN: 9780471915553 bzw. 0471915556, in Englisch, Wiley, gebundenes Buch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Cloud 9 Books.
Wiley. Hardcover. 0471915556 Like New Condition. . Fine.
Von Händler/Antiquariat, Cloud 9 Books.
Wiley. Hardcover. 0471915556 Like New Condition. . Fine.
5
Symbolbild
The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
EN HC NWISBN: 9780471915553 bzw. 0471915556, in Englisch, Wiley, gebundenes Buch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Cloud 9 Books.
Wiley. Hardcover. 0471915556 New Condition. . New.
Von Händler/Antiquariat, Cloud 9 Books.
Wiley. Hardcover. 0471915556 New Condition. . New.
Lade…