We Need Diverse Ya Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    The Powell's Playlist | June 15, 2015

    Matthew Quick: IMG Portia Kane's '80s Metal Mix



    Two of Love May Fail's main characters, Portia Kane and Chuck Bass — now in their early 40s — still love the metal music that was... Continue »
    1. $18.19 Sale Hardcover add to wish list

      Love May Fail

      Matthew Quick 9780062285560

    spacer

Introduction to Circuit Complexity (Texts in Theoretical Computer Science)

by

Introduction to Circuit Complexity (Texts in Theoretical Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

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.

Synopsis:

This advanced handbook 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 an extensive discussion of the literature to facilitate future research.

Synopsis:

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.

Product Details

ISBN:
9783540643104
Author:
Vollmer, Heribert
Publisher:
Springer
Location:
Berlin, Heidelberg
Subject:
Computer Science
Subject:
Engineering - Electrical & Electronic
Subject:
Logic, symbolic and mathematical
Subject:
Electronics - Circuits - General
Subject:
Design
Subject:
Electronic digital computers
Subject:
Computational complexity
Subject:
Algebra - Boolean
Subject:
Electricity
Subject:
Algorithmus
Subject:
Berechnungskomplexität
Subject:
Berechnungsmodell
Subject:
Komplexitätsklassen
Subject:
Schaltkreis
Subject:
algorithm
Subject:
Boolean circuits
Subject:
Complexity classes
Subject:
Computational methods
Subject:
Computation by Abstract Devices
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Mathematical Logic and Formal Languages
Subject:
Computational Mathematics and Numerical Analysis
Subject:
Electronics and Microelectronics, Instrumentation Gibt einen umfassenden Überblick über "Komplexität von Schaltkreisen", ein Spezialgebiet der Theoretischen Informatik. Stellt Methoden und Ergebnisse aus allen relevanten Teilgebieten vor. Ausführliche
Subject:
Electricity-General Electricity
Subject:
Machine Theory
Subject:
Electronics and Microelectronics, Instrumentation
Subject:
B
Subject:
Computer software
Subject:
Computer science_xMathematics
Subject:
Electronics
Copyright:
Edition Description:
Book
Series:
Texts in Theoretical Computer Science. An EATCS Series
Series Volume:
no. 1862
Publication Date:
19990731
Binding:
HARDCOVER
Language:
English
Illustrations:
Yes
Pages:
283
Dimensions:
235 x 155 mm 1290 gr

Other books you might like

  1. Computable Analysis (Texts in... New Hardcover $118.50
  2. Descriptive Complexity (Graduate... New Hardcover $145.50
  3. Complexity theory retrospective :in... New Hardcover $200.95
  4. Structural Complexity New Hardcover $108.50
  5. Basic Category Theory for Computer... New Trade Paper $38.50
  6. Introduction to Formal Hardware... New Trade Paper $118.50

Related Subjects

Computers and Internet » Computers Reference » Beginning and Reference
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Science and Mathematics » Chemistry » Chemical Engineering
Science and Mathematics » Electricity » General Electricity
Science and Mathematics » Electricity » General Electronics

Introduction to Circuit Complexity (Texts in Theoretical Computer Science) New Hardcover
0 stars - 0 reviews
$130.25 In Stock
Product details 283 pages Springer - English 9783540643104 Reviews:
"Synopsis" by , This advanced handbook 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 an extensive discussion of the literature to facilitate future research.
"Synopsis" by , 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.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.