Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (Q4094391): Difference between revisions

@@ Property / cites work @@
+Ordinal Hierarchies and Naming Complexity Classes
@@ Property / cites work: Ordinal Hierarchies and Naming Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Independent Theory of the Complexity of Recursive Functions
+Normal rank
@@ Property / cites work @@
+On Effective Procedures for Speeding Up Algorithms
+Normal rank
@@ Property / cites work @@
+Computational Complexity and the Existence of Complexity Gaps
+Normal rank
@@ Property / cites work @@
+The Operator Gap
@@ Property / cites work: The Operator Gap / rank @@
+Normal rank
@@ Property / cites work @@
+An Overview of the Theory of Computational Complexity
+Normal rank
@@ Property / cites work @@
+On Effectively Computable Operators
@@ Property / cites work: On Effectively Computable Operators / rank @@
+Normal rank
@@ Property / cites work @@
+On size vs. efficiency for programs admitting speed-ups
+Normal rank
@@ Property / cites work @@
+Classes of computable functions defined by bounds on computation
+Normal rank
@@ Property / cites work @@
+Computational speed-up by effective operators
@@ Property / cites work: Computational speed-up by effective operators / rank @@
+Normal rank
@@ Property / cites work @@
+Honest bounds for complexity classes of recursive functions
+Normal rank
@@ Property / cites work @@
+Speed-Ups by changing the order in which sets are enumerated
+Normal rank