Advertisement

Introduction

  • José Luis Balcázar
  • Josep Díaz
  • Joaquim Gabarró
Part of the Texts in Theoretical Computer Science An EATCS Series book series (TTCS)

Abstract

In its most general sense, Complexity Theory encompasses several quite different approaches. All of them have in common two characteristics, which can be considered as a general definition of the field: first, they study algorithms and the problems solved by them; second, they focus on the computational resources required by these algorithms.

Keywords

Turing Machine Complexity Theory Boolean Circuit Polynomial Time Reduction Polynomial Setting 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • José Luis Balcázar
    • 1
  • Josep Díaz
    • 1
  • Joaquim Gabarró
    • 1
  1. 1.Department of Software (LSI)Universitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations