Shokrollahi Mohammad (23 results)
Language: English
Published by Springer, 2010
- Softcover
- International Edition
Seller: Sizzler Texts, SAN GABRIEL, CA, U.S.A.Sizzler Texts
Contact seller5-star sellerInternational EditionCondition: New
£ 45.64
£ 11.08 shippingShips within U.S.A.Quantity: Over 20 available
Soft cover. Condition: New. Dust Jacket Condition: New. International Edition. **International edition** Read carefully before purchase: This book is the international edition in mint condition with the different ISBN and book cover design, the major content is printed in full English as same as the original North American editi…on. The book printed in black and white, generally send in twenty-four hours after the order confirmed. All shipments contain tracking numbers. Great professional textbook selling experience and expedite shipping service.
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften, 315)
Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad A.
Language: English
Published by Springer, 1996
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 117.36
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: 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.:
Language: English
Published by Berlin. Springer Verlag., 1997
- Softcover
Seller: Antiquariat Bernhardt, Kassel, GermanyAntiquariat Bernhardt
Contact seller5-star sellerCondition: Used - Fine
£ 90.22
£ 42.89 shippingShips from Germany to U.S.A.Quantity: 1 available
Karton Karton. Condition: 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 d…er deutschen Post. Sprache: Englisch Gewicht in Gramm: 1050.
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften, 315)
Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad A.
Language: English
Published by Springer, 2010
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 127.60
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
Language: English
Published by Springer, 2010
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 127.59
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Springer, 2010
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 145.70
£ 1.95 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Springer, 2010
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 145.80
£ 1.95 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften)
Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad A.
Language: English
Published by Springer, 2010
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 154.56
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften, 315)
Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad A.
Language: English
Published by Springer, 1996
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 154.56
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Springer, 2010
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 141.18
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2010
- Softcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
£ 170.37
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. 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. Softcover reprint of hardcover 1st ed. 1997.
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 1996
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
£ 174.06
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. 1997 ed. 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.
Language: English
Published by Springer, 2010
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 174.54
£ 2.95 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 648.
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften, 315)
Bürgisser, Peter; Clausen, Michael; Shokrollahi, Mohammad A.; Lickteig, T. [Assistant]
Language: English
Published by Springer, 1996
- Hardcover
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contact seller5-star sellerCondition: New
£ 191.32
£ 5.14 shippingShips within U.S.A.Quantity: 1 available
hardcover. Condition: New. In shrink wrap. Looks like an interesting title.
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.
Language: English
Published by Springer, 1996
- Hardcover
Seller: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermanyBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contact seller5-star sellerCondition: Used - Very good
£ 167.33
£ 34.34 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: gut. 1996. Algebraic Complexity Theory: With the Collab. of Thomas Lickteig (Grundlehren der mathematischen Wissenschaften, 315, Band 315) In deutscher Sprache. pages.
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2010
- Softcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
£ 161.94
£ 65.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. 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. Softcover reprint of hardcover 1st ed. 1997.
Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften (315))
Bürgisser, Peter, Clausen, Michael, Shokrollahi, Mohammad A.
Language: English
Published by Springer, 2010
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 202.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 1996
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
£ 166.01
£ 65.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. 1997 ed. 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.
- Hardcover
- Print on Demand
Seller: True World of Books, Delhi, IndiaTrue World of Books
Contact seller5-star sellerLeatherBound. Condition: New. BOOKS ARE EXEMPT FROM IMPORT DUTIES AND TARIFFS; NO EXTRA CHARGES APPLY. LeatherBound edition. Condition: New. Reprinted from 1903 edition. Leather Binding on Spine and Corners with Golden leaf printing on spine. Bound in genuine leather with Satin ribbon page markers and Spine with raised gilt band…s. A perfect gift for your loved ones. Pages: 421 NO changes have been made to the original text. This is NOT a retyped or an ocr'd reprint. Illustrations, Index, if any, are included in black and white. Each page is checked manually before printing. As this print on demand book is reprinted from a very old book, there could be some missing or flawed pages, but we always try to make the book as complete as possible. Fold-outs, if any, are not part of the book. If the original book was published in multiple volumes then this reprint is of only one volume, not the whole set. Sewing binding for longer life, where the book block is actually sewn (smythe sewn/section sewn) with thread before binding which results in a more durable type of binding. Pages: 421.
Language: English
Published by Springer Berlin Heidelberg, 2010
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 112.79
£ 42.11 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 metamathema…tical problems have led to the intensive.
Language: English
Published by Springer Berlin Heidelberg, 1996
- Hardcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 112.79
£ 42.11 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 metamathema…tical problems have led to the intensive.
Language: English
Published by Springer, 2010
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 181.37
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 648 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Language: English
Published by Springer, 2010
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 190.88
£ 8.55 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 648.
