Q5014441 (Q5014441): Difference between revisions

@@ Property / arXiv ID @@
+.03014
@@ Property / arXiv ID: 1509.03014 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved witnessing and local improvement principles for second-order bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Algorithms with polynomial interpretation termination proof
+Normal rank
@@ Property / cites work @@
+Q4475109
@@ Property / cites work: Q4475109 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-interpretations. A way to control resources
@@ Property / cites work: Quasi-interpretations. A way to control resources / rank @@
+Normal rank
@@ Property / cites work @@
+Proof-theoretic analysis of termination proofs
@@ Property / cites work: Proof-theoretic analysis of termination proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3800030
@@ Property / cites work: Q3800030 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4215631
@@ Property / cites work: Q4215631 / rank @@
+Normal rank
@@ Property / cites work @@
+Orderings for term-rewriting systems
@@ Property / cites work: Orderings for term-rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3567845
@@ Property / cites work: Q3567845 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination proofs by multiset path orderings imply primitive recursive derivation lengths
+Normal rank
@@ Property / cites work @@
+Q4265595
@@ Property / cites work: Q4265595 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474861
@@ Property / cites work: Q4474861 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysing the implicit complexity of programs.
@@ Property / cites work: Analysing the implicit complexity of programs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4436033
@@ Property / cites work: Q4436033 / rank @@
+Normal rank
@@ Property / cites work @@
+A term rewriting characterization of the functions computable in polynomial space
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Q4855362
@@ Property / cites work: Q4855362 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4799892
@@ Property / cites work: Q4799892 / rank @@
+Normal rank
@@ Property / cites work @@
+Subrecursiveness: Machine-independent notions of computability in restricted time and storage
+Normal rank
@@ Property / cites work @@
+Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
+Normal rank
@@ Property / cites work @@
+Q3141916
@@ Property / cites work: Q3141916 / rank @@
+Normal rank