Completeness Reduction Algebraic Complexity by Bürgisser Peter (15 results)

Condition: good. Fast Free Shipping â" Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy.

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.

Hardcover. Condition: Sehr gut. Bln., Springer (2000). gr.8°. 16 figs. XII, 168 p. Hardbound. (corners slightly bumped).- Algorithms and Computation in Mathematics, 7.- Incl. bibliography.- Dedication by the author on flyleaf.

Condition: New.

Condition: New. In English.

hardcover. Condition: New. In shrink wrap. Looks like an interesting title.

Condition: New. In English.

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.…

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. …

Springer, Berlin, Heidelberg, New York, . - 2000, Algorithms and Computation in Mathematics, Volume 7, 16x24 cm, relié, XII + 168 pages Très bon état - Pour les envois hors de France, la tafication «livre & brochure» pour les frais de port a disparue.Les frais de port annoncés correspondent à une moyenne. Ils seront calculés au plus juste en fonction du poids de votre article.…

Condition: new. Questo è un articolo print on demand.

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. …

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. …

Gebunden. 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.Only monograph with the latest results in the field.Includes supplementary material: sn.pub/extrasThis is a thorough and comprehensive treatment of the theory of NP-completeness in.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 184 pp. Englisch.…