The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012): Difference between revisions

@@ Property / Wikidata QID @@
+Q113318276
@@ Property / Wikidata QID: Q113318276 / 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.1016/j.entcs.2011.03.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2057322444
@@ Property / OpenAlex ID: W2057322444 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Expressibility of Higher Order Logics
@@ Property / cites work: Expressibility of Higher Order Logics / rank @@
+Normal rank
@@ Property / cites work @@
+Computing queries with higher-order logics
@@ Property / cites work: Computing queries with higher-order logics / rank @@
+Normal rank
@@ Property / cites work @@
+On the expressive power of database queries with intermediate types
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798297
@@ Property / cites work: Q3798297 / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptive characterizations of computational complexity
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+A lattice-theoretical fixpoint theorem and its applications
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5179012