Anzeige
Erschienen in:
1999 | OriginalPaper | Buchkapitel
Background in Complexity
verfasst von : Neil Immerman
Erschienen in: Descriptive Complexity
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Computational Complexity measures the amount of computational resources, such as time and space, that are needed, as a function of the size of the input, to compute a query. This chapter introduces the reader to complexity theory. We define the complexity measures and complexity classes that we study in the rest of the book. We also explain some of their basic properties, complete problems, and interrelationships.