Skip to main content

Complexity Theory of Real Functions

  • Book
  • © 1991


Part of the book series: Progress in Theoretical Computer Science (PTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others


Table of contents (10 chapters)

Authors and Affiliations

  • Department of Computer Science, State University of New York at Stony Brook, Stony Brook, USA

    Ker-I Ko

Bibliographic Information

Publish with us