Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Angličtina
183 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
9.70
€
/
Brožovaná
48.93
€
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.
Informácie o knihe
Angličtina
Kategórie
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
154.29
€
/
Brožovaná
9.80
€
/
Brožovaná
32.85
€
/
Brožovaná
13.44
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?