Contact
How to shop
Delivery
Shopping guide
English
221 b
Up to 30 days for returns
Customers also purchased
/
Game
6 540
Ft
/
Paperback
19 979
Ft
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
8 321
Ft
/
Hardback
11 676
Ft
/
Hardback
13 121
Ft
/
Paperback
5 909
Ft
/
Paperback
41 623
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?