On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508): Difference between revisions

@@ Property / arXiv ID @@
+.2956
@@ Property / arXiv ID: 1201.2956 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear logic by levels and bounded time complexity
+Normal rank
@@ Property / cites work @@
+Q2708316
@@ Property / cites work: Q2708316 / rank @@
+Normal rank
@@ Property / cites work @@
+Light types for polynomial time computation in lambda calculus
+Normal rank
@@ Property / cites work @@
+Context semantics, linear logic, and computational complexity
+Normal rank
@@ Property / cites work @@
+Linear Dependent Types and Relative Completeness
@@ Property / cites work: Linear Dependent Types and Relative Completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Linear logic and elementary time
@@ Property / cites work: Linear logic and elementary time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4842980
@@ Property / cites work: Q4842980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625124
@@ Property / cites work: Q5625124 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear logic
@@ Property / cites work: Linear logic / rank @@
+Normal rank
@@ Property / cites work @@
+Light linear logic
@@ Property / cites work: Light linear logic / rank @@
+Normal rank
@@ Property / cites work @@
+Soft linear logic and polynomial time
@@ Property / cites work: Soft linear logic and polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets
+Normal rank