skip to main content
Idioma:

On the Structure of Feasible Computations11This research has been supported in part by the National Science Foundation Grants GJ-33171X and DCR75-09433, and Grant 70/755 from Fundacao de Amparo a Pesquisa do Estado de Sao Paulo, and by Universidade Estadual de Campinas

Hartmanis, J. ; Simon, J.

Advances In Computers, 1976, Vol.14, p.1-43

Elsevier Science & Technology

Texto completo disponível

Citações Citado por
  • Título:
    On the Structure of Feasible Computations11This research has been supported in part by the National Science Foundation Grants GJ-33171X and DCR75-09433, and Grant 70/755 from Fundacao de Amparo a Pesquisa do Estado de Sao Paulo, and by Universidade Estadual de Campinas
  • Autor: Hartmanis, J. ; Simon, J.
  • É parte de: Advances In Computers, 1976, Vol.14, p.1-43
  • Descrição: The theory of computational complexity is the study of the quantitative aspects of computing, and it has been an active area of computer science research for some years. During this time, the computational complexity theory developed so rapidly that by now it has become a principal part of theoretical computer science and one of the most active research areas in all of computer science. The development of computational complexity theory can be divided roughly into two parts. The first phase of this development established the general properties of specific computational measures, such as computation time and memory used, and provided an elegant axiomatic approach for the systematic investigation of properties common to all computational complexity measures. The purpose of this chapter is to give an overview of this development in the study of feasible computations and to give an insight into some of the recent results, as well as an appreciation of the unity and structure that have emerged in this area of research. To achieve these goals, this chapter treats only a selected set of topics that illustrate the major ideas and show the unity of the emerging understanding and emphasize the essential open problems.
  • Editor: Elsevier Science & Technology
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.