An Overview of the Theory of Computational Complexity

Cited in

(39)

Complexity-class-encoding sets
Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
scientific article; zbMATH DE number 3473353 (Why is no real title available?)
Complexity metatheorems for context-free grammar problems
Some applications of the McCreight-Meyer algorithm in abstract complexity theory
Relations between diagonalization, proof systems, and complexity gaps
On recursive bounds for the exceptional values in speed-up
The intrinsic difficulty of recursive functions
A note on complexity measures for inductive classes in constructive type theory
On the power of recursive optimizers
Total complexity and the inference of best programs
Nonexistence of program optimizers in several abstract settings
The complexity of the membership problem for some extensions of context-free languagest†
Polynomial and abstract subrecursive classes
scientific article; zbMATH DE number 3619885 (Why is no real title available?)
Algorithmic complexity of recursive and inductive algorithms
Complexity classes of provable recursive functions
Meeting of the Association for Symbolic Logic, Dallas 1973
Complexity of algorithms and computations
Relativization of the Theory of Computational Complexity
Honest bounds for complexity classes of recursive functions
Theory construction in psychology: The interpretation and integration of psychological data
Two types of properties for complexity measures
Computational complexity of formal translations
On generalized computational complexity
Complexity of computable functions for a generalized storage measure
A survey of techniques in applied computational complexity
On non-determinacy in simple computing devices
Recursively enumerable complexity sequences and measure independence
Effective category and measure in abstract complexity theory
Computation of recursive functionals using minimal initial segments
The complexity types of computable sets
Degrees of computational complexity
Separating the classes of recursively enumerable languages based on machine size
Toward an abstract theory of data compression
Closure operations on measures of computational complexity
COMPLEXITY AND INFORMATION TECHNOLOGY IN DYNAMIC SYSTEMS
The behavioral properties of homogeneous structures
Effective category and measure in abstract complexity theory

This page was built for publication: An Overview of the Theory of Computational Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633652)