College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||An Overview of the Theory of Computational Complexity|
|Authors: ||Hartmanis, Juris|
Hopcroft, John E.
|Keywords: ||computer science|
|Issue Date: ||Apr-1970|
|Publisher: ||Cornell University|
|Abstract: ||The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative aspects of computations and its central theme is the measuring of the difficulty of computing functions. The paper does not attempt to give an exhaustive survey but instead presents the basic concepts, results and techniques of computational complexity from a new point of view from which the ideas are more easily understood and fit together as a coherant whole.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.