Contatto
Come acquistare
Consegna
Guida all'acquisto
Inglese
215 b
30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
10.59
€
/
In brossura
58.09
€
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study.It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory.
Informazioni sul libro
Inglese
Categorie
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
172.69
€
/
In brossura
10.69
€
/
In brossura
35.79
€
/
In brossura
14.99
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?