{"product_id":"9783540667520","title":"Algorithms and Computation in Mathematics","description":"\u003ch1\u003eAlgorithms and Computation in Mathematics\u003c\/h1\u003e \u003ch2\u003eBürgisser, Peter\u003c\/h2\u003e \u003cp\u003eOne 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2000-06-21\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9783540667520\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-3-662-04179-6\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 168\u003c\/p\u003e ","brand":"Springer Berlin Heidelberg","offers":[{"title":"Default Title","offer_id":44499555156108,"sku":"9783540667520","price":98.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783540667520.jpg?v=1775709639","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783540667520","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}