2 910 883 libros electrónicos en 110 idiomas
¿No le conviene? No hay problema. Puedes devolver los artículos hasta 30 días
No se equivocará con un vale de regalo. El destinatario puede elegir cualquier producto de nuestra oferta.
Hasta 30 días para devoluciones
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.
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?