Non-elementary lower bound for Propositional Duration Calculus (Q1129106): Difference between revisions

@@ Property / author @@
-Alexander Rabinovich
@@ Property / author: Alexander Rabinovich / rank @@
-Normal rank
@@ Property / author @@
+Alexander Rabinovich
@@ Property / author: Alexander Rabinovich / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+Q5641083
@@ Property / cites work: Q5641083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4222923
@@ Property / cites work: Q4222923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Duration calculus: Logical foundations
@@ Property / cites work: Duration calculus: Logical foundations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281508
@@ Property / cites work: Q4281508 / rank @@
+Normal rank
@@ Property / cites work @@
+A calculus of durations
@@ Property / cites work: A calculus of durations / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(98)00027-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1993397971
@@ Property / OpenAlex ID: W1993397971 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1129106