9783540605829 - algebraic complexity theory: with the collab. of thomas lickteig (grundlehren der mathematischen wissenschaften, 315, band 315) von bürgisser, peter; clausen, michael; shokrollahi, mohammad a. (5 Ergebnisse)
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften, 315)
Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad A.
Sprache: Englisch
Verlag: Springer, 1996
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 140,68
EUR 13,94 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
Algebraic Complexity Theory: With the Collab. of Thomas Lickteig (Grundlehren der mathematischen Wissenschaften, 315, Band 315)
Bürgisser, Peter, Michael Clausen Mohammad A. Shokrollahi a. o.:
Sprache: Englisch
Verlag: Berlin. Springer Verlag., 1997
- Softcover
Anbieter: Antiquariat Bernhardt, Kassel, DeutschlandAntiquariat Bernhardt
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Sehr gut
EUR 101,90
EUR 49,90 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
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.
Sprache: Englisch
Verlag: Springer Vieweg, 1996
- Hardcover
Anbieter: Buchpark, Trebbin, DeutschlandBuchpark
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Sehr gut
EUR 68,53
EUR 105,00 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
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.
Sprache: Englisch
Verlag: Springer, 1996
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 159,78
EUR 65,67 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
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.
Algebraic Complexity Theory: With the Collab. of Thomas Lickteig (Grundlehren der mathematischen Wissenschaften, 315, Band 315) Clausen, Michael, Peter Bürgisser A. Shokrollahi Mohammad u. a.
Clausen, Michael, Peter Bürgisser A. Shokrollahi Mohammad u. a.
Sprache: Englisch
Verlag: Springer, 1996
- Hardcover
Anbieter: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, DeutschlandBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 189,00
EUR 39,95 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Zustand: gut. 1996. Algebraic Complexity Theory: With the Collab. of Thomas Lickteig (Grundlehren der mathematischen Wissenschaften, 315, Band 315) In deutscher Sprache. pages.
