Order Total (1 Item Items):
Shipping Destination:
Complexity Theory Real Functions (22 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (22)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (18)
- As New, Fine or Near Fine (2)
- Very Good or Good (2)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (4)
- Not Print on Demand (16)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
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.
-
Condition: New.
-
Complexity Theory of Real Functions.
Seller: Antiquariat Renner OHG, Albstadt, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
Hardcover. Condition: Sehr gut. Boston, Birkhäuser 1991. gr.8°. VII, 309 p. Hardbound. Progress in Theoretical Computer Science.- Name on flyleaf, otherwise like new.
-
Complexity Theory of Real Functions (Progress in Theoretical Computer Science)
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
US$ 62.26
US$ 33.58 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCloth. Condition: Very Good. Type: Book Small plain label inside cover.
-
Condition: New.
-
Condition: New.
-
Complexity Theory of Real Functions (Progress in Theoretical Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 107.74
US$ 16.09 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New. pp. 324.
-
Complexity Theory of Real Functions
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . .
-
Condition: New.
-
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 309 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
-
Condition: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . . Books ship from the US and Ireland.
-
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Complexity Theory of Real Functions
Language: English
Published by Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. In addition, the theoretical studies of the notion of polynomial-time tractability some times also yield interesting new practical algorithms. A typical exam ple is the application of the ellipsoid algorithm to combinatorial op timization problems (see, for example, Lovasz [1986]). On the other hand, it has a strong influence on many different branches of mathe matics, including combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a construc tive proof which admits a polynomial-time algorithm for the solution. One of the examples is the recent work on algorithmic theory of per mutation groups. In the area of numerical computation, there are also two tradi tionally independent approaches: recursive analysis and numerical analysis.
-
Condition: new. Questo è un articolo print on demand.
-
Complexity Theory of Real Functions
Language: English
Published by Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. In addition, the theoretical studies of the notion of polynomial-time tractability some times also yield interesting new practical algorithms. A typical exam ple is the application of the ellipsoid algorithm to combinatorial op timization problems (see, for example, Lovasz [1986]). On the other hand, it has a strong influence on many different branches of mathe matics, including combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a construc tive proof which admits a polynomial-time algorithm for the solution. One of the examples is the recent work on algorithmic theory of per mutation groups. In the area of numerical computation, there are also two tradi tionally independent approaches: recursive analysis and numerical analysis. 324 pp. Englisch.
-
US$ 132.53
US$ 8.73 shipping
Ships from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 324 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Complexity Theory of Real Functions
Language: English
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 126.10
US$ 20.94 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Condition: New. PRINT ON DEMAND pp. 324.
-
Complexity Theory of Real Functions
Language: English
Published by Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. In addition, the theoretical studies of the notion of polynomial-time tractability some times also yield interesting new practical algorithms. A typical exam ple is the application of the ellipsoid algorithm to combinatorial op timization problems (see, for example, Lovasz [1986]). On the other hand, it has a strong influence on many different branches of mathe matics, including combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a construc tive proof which admits a polynomial-time algorithm for the solution. One of the examples is the recent work on algorithmic theory of per mutation groups. In the area of numerical computation, there are also two tradi tionally independent approaches: recursive analysis and numerical analysis.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 324 pp. Englisch.
