Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7) - Softcover
Synopsis
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 research and graduate level.
"synopsis" may belong to another edition of this title.
Review
".... The subject matter of the book is not easy, since it involves prerequisites from several areas, among them complexity theory, combinatorics, analytic number theory, and representations of symmetric and general linear groups. But the author goes to great lengths to motivate his results, to put them into perspective, and to explain the proofs carefully. In summary, this monograph advances its area of algebraic complexity theory, and is a must for people for working on this subject. And it is a pleasure to read."
Joachim von zur Gathen, Mathematical Reviews, Issue 2001g
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Completeness and Reduction in Algebraic Complexity...
Stock Image
Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020217213
Stock Image
Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642086045_new
Buy New
£ 94.13
Shipping:
£ 11.98
From United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Completeness and Reduction in Algebraic Complexity Theory
Published by
Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642086047
ISBN 13: 9783642086045
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 184 pp. Englisch. Seller Inventory # 9783642086045
Seller Image
Completeness and Reduction in Algebraic Complexity Theory
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642086047
ISBN 13: 9783642086045
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Only monograph with the latest results in the field.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 inte. Seller Inventory # 5047641
Stock Image
Completeness and Reduction in Algebraic Complexity Theory
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 184. Seller Inventory # 262450998
Stock Image
Completeness and Reduction in Algebraic Complexity Theory
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 184 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 5429737
Stock Image
Completeness and Reduction in Algebraic Complexity Theory
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 184. Seller Inventory # 182451004
Seller Image
Completeness and Reduction in Algebraic Complexity Theory
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Completeness and Reduction in Algebraic Complexity Theory | Peter Bürgisser | Taschenbuch | xii | Englisch | 2010 | Springer | EAN 9783642086045 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 107175119
Seller Image
Completeness and Reduction in Algebraic Complexity Theory
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642086047
ISBN 13: 9783642086045
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet. By contrast, in algebraic models of computation, the basic computational step is an arithmetic operation (or comparison) of elements of a fixed field, for in stance of real numbers. Hereby one assumes exact arithmetic. In 1989, Blum, Shub, and Smale [12] combined existing algebraic models of computation with the concept of uniformity and developed a theory of NP-completeness over the reals (BSS-model). Their paper created a renewed interest in the field of algebraic complexity and initiated new research directions. The ultimate goal of the BSS-model (and its future extensions) is to unite classical dis crete complexity theory with numerical analysis and thus to provide a deeper foundation of scientific computation (cf. [11, 101]). Already ten years before the BSS-paper, Valiant [107, 110] had proposed an analogue of the theory of NP-completeness in an entirely algebraic frame work, in connection with his famous hardness result for the permanent [108]. While the part of his theory based on the Turing approach (#P-completeness) is now standard and well-known among the theoretical computer science com munity, his algebraic completeness result for the permanents received much less attention.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 184 pp. Englisch. Seller Inventory # 9783642086045
Seller Image
Completeness and Reduction in Algebraic Complexity Theory
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg, 2010
ISBN 10: 3642086047
ISBN 13: 9783642086045
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet. By contrast, in algebraic models of computation, the basic computational step is an arithmetic operation (or comparison) of elements of a fixed field, for in stance of real numbers. Hereby one assumes exact arithmetic. In 1989, Blum, Shub, and Smale [12] combined existing algebraic models of computation with the concept of uniformity and developed a theory of NP-completeness over the reals (BSS-model). Their paper created a renewed interest in the field of algebraic complexity and initiated new research directions. The ultimate goal of the BSS-model (and its future extensions) is to unite classical dis crete complexity theory with numerical analysis and thus to provide a deeper foundation of scientific computation (cf. [11, 101]). Already ten years before the BSS-paper, Valiant [107, 110] had proposed an analogue of the theory of NP-completeness in an entirely algebraic frame work, in connection with his famous hardness result for the permanent [108]. While the part of his theory based on the Turing approach (#P-completeness) is now standard and well-known among the theoretical computer science com munity, his algebraic completeness result for the permanents received much less attention. Seller Inventory # 9783642086045