Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419): Difference between revisions

@@ Property / author @@
-Amir M. Ben-Amram
@@ Property / author: Amir M. Ben-Amram / rank @@
-Normal rank
@@ Property / author @@
+Amir M. Ben-Amram
@@ Property / author: Amir M. Ben-Amram / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-69407-6_7
+Normal rank
@@ Property / OpenAlex ID @@
+W1548801608
@@ Property / OpenAlex ID: W1548801608 / rank @@
+Normal rank
@@ Property / cites work @@
+New Computational Paradigms
@@ Property / cites work: New Computational Paradigms / rank @@
+Normal rank
@@ Property / cites work @@
+A flow calculus of             <i>mwp</i>             -bounds for complexity analysis
+Normal rank
@@ Property / cites work @@
+On the computational complexity of imperative programming languages
+Normal rank
@@ Property / cites work @@
+Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
+Normal rank