Complexity and Structure (Lecture Notes in Computer Science, 211) | EKB DL

Home BookComplexity and Structure (Lecture Notes in Computer Science, 211)

Complexity and Structure (Lecture Notes in Computer Science, 211)

Complexity and Structure (Lecture Notes in Computer Science, 211)

Description

Preliminaries.- Circuit-size complexity.- Probabilistic Algorithms.- Sparse sets.- The low and high hierarchies.- Oracles.

Keywords

COMPUTATIONAL COMPLEXITY

1986Book

Author(s)Uwe Schöning

PublisherSpringer

ISBN9783540160793

LanguageEnglish

Similar Books

Vorlesungen zur Komplexitätstheorie

Vorlesungen zur Komplexitätstheorie

Modified Branching Programs and Their Computational Power

Modified Branching Programs and Their Computational Power

Introduction to Circuit Complexity A Uniform Approach

Introduction to Circuit Complexity A Uniform Approach

Structural Complexity II (Monographs in Theoretical Computer Science. An EATCS Series)

Structural Complexity II (Monographs in Theoretical Computer Science. An EATCS Series)

Computability and Complexity Theory

Computability and Complexity Theory

Descriptive Complexity

Descriptive Complexity

Randomness and Completeness in Computational Complexity

Randomness and Completeness in Computational Complexity

Computability and Complexity Theory

Computability and Complexity Theory

Logic and Complexity

Logic and Complexity

Recursion on the Countable Functionals (Lecture Notes in Mathematics, 811)

Recursion on the Countable Functionals (Lecture Notes in Mathematics, 811)