25 Women to Read Before You Die
 
 

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


    Interviews | August 31, 2015

    Shawn Donley: IMG Bill Clegg: The Powells.com Interview



    Bill CleggIn January of this year, eight months before its release date, the buzz was already starting to build for Bill Clegg's Did You Ever Have a Family.... Continue »
    1. $18.20 Sale Hardcover add to wish list

      Did You Ever Have a Family

      Bill Clegg 9781476798172

    spacer
Qualifying orders ship free.
$200.95
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Mathematics- Logic and Philosophy

This title in other editions

Algorithms and Computation in Mathematics #7: Completeness and Reduction in Algebraic Complexity Theory

by

Algorithms and Computation in Mathematics #7: Completeness and Reduction in Algebraic Complexity Theory Cover

 

Synopses & Reviews

Publisher Comments:

This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity; fast evaluation of representations of general linear groups; and complexity of immanants.

Table of Contents

1. Introduction.- 2. Valiant's Algebraic Model of NP-Completeness.- 3. Some Complete Families of Polynomials.- 4. Cook's versus Valiant's Hypothesis.- 5. The Structure of Valiant's Complexity Classes.- 6. Fast Evaluation of Representations of General Linear Groups.- 7. The Complexity of Immanants.- 8. Separation Results and Future Directions.- References.- List of Notations.- Index

Product Details

ISBN:
9783642086045
Author:
Burgisser, Peter
Publisher:
Springer
Author:
rgisser, Peter
Author:
Peter B
Author:
&
Author:
rgisser
Author:
B
Author:
uuml
Location:
Berlin, Heidelberg
Subject:
Number Systems
Subject:
NP-Completeness
Subject:
Complexity
Subject:
Computational Mathematics and Numerical Analysis
Subject:
Theory of computation
Subject:
Algebra
Subject:
Algebra Bürgisser, a top expert on algebraic complexity theory, has written a monograph on current research in this field. This book gives new results in the theory of NP-completeness. It is written for mathematicians and computer scientists on both rese
Subject:
Mathematics-Logic and Philosophy
Subject:
Counting & Numeration
Subject:
Mathematics
Subject:
Language, literature and biography
Subject:
mathematics and statistics
Subject:
Computer science_xMathematics
Subject:
Information Theory
Copyright:
Edition Description:
Softcover reprint of hardcover 1st ed. 2000
Series:
Algorithms and Computation in Mathematics
Series Volume:
7
Publication Date:
20101203
Binding:
TRADE PAPER
Language:
English
Pages:
180
Dimensions:
235 x 155 mm 287 gr

Related Subjects

Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Differential Geometry
Science and Mathematics » Mathematics » Foundations and Logic
Science and Mathematics » Mathematics » Introduction
Science and Mathematics » Mathematics » Logic and Philosophy

Algorithms and Computation in Mathematics #7: Completeness and Reduction in Algebraic Complexity Theory New Trade Paper
0 stars - 0 reviews
$200.95 In Stock
Product details 180 pages Springer - English 9783642086045 Reviews:
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.