Pages that link to "Item:Q5633652"

The following pages link to An Overview of the Theory of Computational Complexity (Q5633652):

Displaying 39 items.

• Effective category and measure in abstract complexity theory (Q672752) (← links)
• Computation of recursive functionals using minimal initial segments (Q787965) (← links)
• Toward an abstract theory of data compression (Q794162) (← links)
• On the power of recursive optimizers (Q1114401) (← links)
• Complexity classes of provable recursive functions (Q1134153) (← links)
• Complexity of algorithms and computations (Q1153141) (← links)
• Theory construction in psychology: The interpretation and integration of psychological data (Q1157291) (← links)
• Two types of properties for complexity measures (Q1158961) (← links)
• Complexity of computable functions for a generalized storage measure (Q1168076) (← links)
• The complexity types of computable sets (Q1190982) (← links)
• Closure operations on measures of computational complexity (Q1219561) (← links)
• A survey of techniques in applied computational complexity (Q1224857) (← links)
• Polynomial and abstract subrecursive classes (Q1227276) (← links)
• The behavioral properties of homogeneous structures (Q1228468) (← links)
• Nonexistence of program optimizers in several abstract settings (Q1231391) (← links)
• Complexity-class-encoding sets (Q1237360) (← links)
• Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
• Some applications of the McCreight-Meyer algorithm in abstract complexity theory (Q1249043) (← links)
• Relations between diagonalization, proof systems, and complexity gaps (Q1254105) (← links)
• A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
• On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
• Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
• The intrinsic difficulty of recursive functions (Q1919986) (← links)
• On non-determinacy in simple computing devices (Q2550291) (← links)
• Degrees of computational complexity (Q2557123) (← links)
• Separating the Classes of Recursively Enumerable Languages Based on Machine Size (Q3455749) (← links)
• Recursively enumerable complexity sequences and measure independence (Q3901505) (← links)
• Computational complexity of formal translations (Q4057597) (← links)
• (Q4057637) (← links)
• Honest bounds for complexity classes of recursive functions (Q4083408) (← links)
• Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (Q4094391) (← links)
• Relativization of the Theory of Computational Complexity (Q4124321) (← links)
• Total complexity and the inference of best programs (Q4133125) (← links)
• COMPLEXITY AND INFORMATION TECHNOLOGY IN DYNAMIC SYSTEMS (Q4162666) (← links)
• On generalized computational complexity (Q4163200) (← links)
• The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
• (Q4182501) (← links)
• Effective category and measure in abstract complexity theory (Q5055887) (← links)
• Meeting of the Association for Symbolic Logic, Dallas 1973 (Q5685043) (← links)