Complexity Theory of Real Functions

  • Ker-I Ko
Part of the Progress in Theoretical Computer Science book series (PTCS)

Table of contents

  1. Front Matter
    Pages i-ix
  2. Ker-I Ko
    Pages 1-11
  3. Ker-I Ko
    Pages 71-106
  4. Ker-I Ko
    Pages 107-158
  5. Ker-I Ko
    Pages 159-189
  6. Ker-I Ko
    Pages 190-214
  7. Ker-I Ko
    Pages 215-246
  8. Ker-I Ko
    Pages 247-273
  9. Back Matter
    Pages 291-310

About this book

Introduction

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.

Keywords

Approximation NP-completeness Notation algorithm algorithms combinatorial optimization complexity complexity theory computability cryptography linear optimization number theory numerical analysis optimization sets

Authors and affiliations

  • Ker-I Ko
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4684-6802-1
  • Copyright Information Birkhäuser Boston 1991
  • Publisher Name Birkhäuser Boston
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4684-6804-5
  • Online ISBN 978-1-4684-6802-1
  • About this book