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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
£ 15.04 shipping from U.S.A. to United Kingdom
Destination, rates & speedsFREE shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-268359
Quantity: 1 available
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: 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. Seller Inventory # ABNR-87326
Quantity: 1 available
Seller: Wonder Book, Frederick, MD, U.S.A.
Condition: 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. Seller Inventory # V10L-01376
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 917691-n
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540643104_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: 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. Seller Inventory # 9783540643104
Quantity: 2 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 917691-n
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540643104
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: 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. Seller Inventory # 9783540643104
Quantity: 2 available
Seller: dsmbooks, Liverpool, United Kingdom
Hardcover. Condition: Like New. Like New. book. Seller Inventory # D7F5-8-M-3540643109-5
Quantity: 1 available