Articoli correlati a Introduction to Circuit Complexity: A Uniform Approach
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 57,44
GRATIS per la spedizione da U.S.A. a Italia
Destinazione, tempi e costi
Risultati della ricerca per Introduction to Circuit Complexity: A Uniform Approach
Foto dell'editore
Introduction To Circuit Complexity - A Uniform Approach
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-268359
Quantità: 1 disponibili
Foto dell'editore
Introduction To Circuit Complexity - A Uniform Approach
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABNR-87326
Quantità: 1 disponibili
Foto dell'editore
Lagoons and Coastal Wetlands in the Global Change Context: Impact and Management Issues: Selected papers of the International Conference . 2004 (Developments in Hydrobiology, 192)
Da: Wonder Book, Frederick, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp. Codice articolo V10L-01376
Quantità: 1 disponibili
Foto dell'editore
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)
Da: ALLBOOKS1, Direk, SA, Australia
Valutazione del venditore 5 su 5 stelle
Codice articolo SHUB268359
Quantità: 1 disponibili
Immagini fornite dal venditore
Introduction to Circuit Complexity
Editore:
Springer, Berlin, Springer Berlin Heidelberg, Springer, 1999
ISBN 10: 3540643109
ISBN 13: 9783540643104
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 272 pp. Englisch. Codice articolo 9783540643104
Quantità: 2 disponibili
Foto dell'editore
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540643104_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Introduction to Circuit Complexity : A Uniform Approach
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 917691-n
Quantità: Più di 20 disponibili
Foto dell'editore
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783540643104
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Introduction to Circuit Complexity
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Presents a broad view of the field covering all the fundamentals needed to study current research papers Introduces methods and results out of all main subareas. Extensive discussion of the literature at the end of each chapter Contains new material that ha. Codice articolo 4896708
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Introduction to Circuit Complexity : A Uniform Approach
Editore:
Springer, Berlin, Springer Berlin Heidelberg, Springer, 1999
ISBN 10: 3540643109
ISBN 13: 9783540643104
Nuovo
Rilegato
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783540643104
Quantità: 2 disponibili