Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Engleski
206 b
Do 30 dana za povrat
Kupci su kupili i
/
Igra
16.98
€
/
Meki uvez
51.67
€
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 automata-theoretic approaches, and includes extensive discussion of the literature to facilitate further study. It begins with efficient boolean circuits for problems with high practical relevance, 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 algebraic complexity and connections to finite model theory.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
22.34
€
/
Meki uvez
29.72
€
/
Meki uvez
7.68
€
/
Tvrdi uvez
34.48
€
/
Tvrdi uvez
30.74
€
/
Tvrdi uvez
31.65
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?