Algorithmically broad languages for polynomial time and space (Q2148807): Difference between revisions

@@ Property / cites work @@
+An arithmetic for non-size-increasing polynomial-time computation
+Normal rank
@@ Property / cites work @@
+Q4850544
@@ Property / cites work: Q4850544 / rank @@
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+Tight worst-case bounds for polynomial loop programs
+Normal rank
@@ Property / cites work @@
+Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Automatic synthesis of typed \(\Lambda\)-programs on term algebras
+Normal rank
@@ Property / cites work @@
+Q4062633
@@ Property / cites work: Q4062633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144755
@@ Property / cites work: Q4144755 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3925859
@@ Property / cites work: Q3925859 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetical hierarchy and complexity of computation
+Normal rank
@@ Property / cites work @@
+Q4525781
@@ Property / cites work: Q4525781 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear types and non-size-increasing polynomial time computation.
+Normal rank
@@ Property / cites work @@
+Bernays and Set Theory
@@ Property / cites work: Bernays and Set Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of imperative programming languages
+Normal rank
@@ Property / cites work @@
+A higher-order characterization of probabilistic polynomial time
+Normal rank
@@ Property / cites work @@
+Q4501154
@@ Property / cites work: Q4501154 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850553
@@ Property / cites work: Q4850553 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474861
@@ Property / cites work: Q4474861 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of alternating log time by ramified recurrence
+Normal rank
@@ Property / cites work @@
+Evolving Graph-Structures and Their Implicit Computational Complexity
+Normal rank
@@ Property / cites work @@
+Primitive recursion in the abstract
@@ Property / cites work: Primitive recursion in the abstract / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
+Normal rank
@@ Property / cites work @@
+Implicit characterizations of FPTIME and NC revisited
+Normal rank
@@ Property / cites work @@
+Characterizing <i>NC</i> with tier 0 pointers
@@ Property / cites work: Characterizing <i>NC</i> with tier 0 pointers / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing PSPACE with pointers
@@ Property / cites work: Characterizing PSPACE with pointers / rank @@
+Normal rank
@@ Property / cites work @@
+A recursion-theoretic approach to NP
@@ Property / cites work: A recursion-theoretic approach to NP / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Predictably Computable Functions
@@ Property / cites work: Classes of Predictably Computable Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4143279
@@ Property / cites work: Q4143279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3141916
@@ Property / cites work: Q3141916 / rank @@
+Normal rank