Bürgisser peter (26 Ergebnisse)

Paperback. Zustand: Brand New. 105 pages. German language. 9.00x6.00x0.27 inches. In Stock.

Zustand: 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. Zustand: 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.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:9783642082283.

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: 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.…

Karton Karton. Zustand: Sehr gut. 618, Seiten mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 1050.…

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: 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. …

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 652 | Sprache: Englisch | Produktart: Bücher | The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.…

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book gathers threads that have evolved across different mathematical disciplines into seamless narrative. It deals with condition as a main aspect in the understanding of the performance ---regarding both stability and complexity--- of numerical algorithms. While the role of condition was shaped in the last half-century, so far there has not been a monograph treating this subject in a uniform and systematic way. The book puts special emphasis on the probabilistic analysis of numerical algorithms via the analysis of the corresponding condition. The exposition's level increases along the book, starting in the context of linear algebra at an undergraduate level and reaching in its third part the recent developments and partial solutions for Smale's 17 th problem which can be explained within a graduate course. Its middle part contains a condition-based course on linear programming that fills a gap between the current elementary expositions of the subject based on the simplex method and those focusing on convex programming.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under standing of the intrinsic computational difficulty of problems.…

Kartoniert. Zustand: Sehr gut erhalten. 265 S.

Taschenbuch. Zustand: Neu. Algebraic Complexity Theory | Peter Bürgisser (u. a.) | Taschenbuch | Grundlehren der mathematischen Wissenschaften | xxiii | Englisch | 2010 | Springer | EAN 9783642082283 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Zustand: Neu. Condition | The Geometry of Numerical Algorithms | Peter Bürgisser (u. a.) | Taschenbuch | Grundlehren der mathematischen Wissenschaften | xxxi | Englisch | 2015 | Springer | EAN 9783642440120 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book gathers threads that have evolved across different mathematical disciplines into seamless narrative. It deals with condition as a main aspect in the understanding of the performance ---regarding both stability and complexity--- of numerical algorithms. While the role of condition was shaped in the last half-century, so far there has not been a monograph treating this subject in a uniform and systematic way.The book puts special emphasis on the probabilistic analysis of numerical algorithms via the analysis of the corresponding condition.The exposition's level increases along the book, starting in the contextof linear algebra at an undergraduate level and reaching in its third part the recent developments and partial solutions for Smale's 17th problem which can be explained within a graduate course. Its middle part contains a condition-based course on linear programming that fills a gap between the current elementary expositions.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under standing of the intrinsic computational difficulty of problems.…

Zustand: gut. 1996. Algebraic Complexity Theory: With the Collab. of Thomas Lickteig (Grundlehren der mathematischen Wissenschaften, 315, Band 315) In deutscher Sprache. pages.

Hardcover. Zustand: Brand New. 2013 edition. 583 pages. French language. 9.25x6.25x1.50 inches. In Stock.

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

Gr.8°. 113 S. Original-Kartonband Wege zur Dichtung, VII. - Umschlag verblasst. Unaufgeschnitten. Gewicht (Gramm): 176.

Gebundene Ausgabe. Zustand: Sehr gut. Gebraucht - Sehr gut kompl., 2. aufl., - leichte beschädigungen oder verschmutzungen, ungelesenes mängelexemplar, gestempelt - Seit der ersten Auflage Anfang 2011, die kurz nach dem Inkrafttreten der Schweizerischen Strafprozessordnung erschien, hat sich der Basler Kommentar 'StPO/JStPO' zu einem Standardkommentar im Bereich Strafverfahrensrecht entwickelt. Das Werk zeigt die modernen Entwicklungen des Strafprozessrechts mit wissenschaftlicher Tiefe auf, legt dabei aber ein besonderes Augenmerk auf die Bedürfnisse der Praxis. Die umfassende und präzise Darstellung der neuesten bundesgerichtlichen und kantonalen Rechtsprechung sowie Literatur, die verlässliche Auswertung und realitätsnahe Lösungsvorschläge zeichnen die Kommentierungen aus.…