Fixed Structure Complexity (Q3503576): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-79723-4_5
+Normal rank
@@ Property / OpenAlex ID @@
+W1856490942
@@ Property / OpenAlex ID: W1856490942 / rank @@
+Normal rank
@@ Property / cites work @@
+Computation Models for Parameterized Complexity
@@ Property / cites work: Computation Models for Parameterized Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4544433
@@ Property / cites work: Q4544433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+When is the evaluation of conjunctive queries tractable?
+Normal rank
@@ Property / cites work @@
+Q3915990
@@ Property / cites work: Q3915990 / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of the domino problem
@@ Property / cites work: The undecidability of the domino problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank