Simple sentences that are hard to decide (Q810009): Difference between revisions

@@ Property / cites work @@
+The undecidability of the domino problem
@@ Property / cites work: The undecidability of the domino problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3220555
@@ Property / cites work: Q3220555 / rank @@
+Normal rank
@@ Property / cites work @@
+Domino-tiling games
@@ Property / cites work: Domino-tiling games / 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 @@
+The complexity of Presburger arithmetic with bounded quantifier alternation depth
+Normal rank
@@ Property / cites work @@
+Q3795666
@@ Property / cites work: Q3795666 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominoes and the complexity of subclasses of logical theories
+Normal rank
@@ Property / cites work @@
+Domino Games and Complexity
@@ Property / cites work: Domino Games and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Boolean algebras
@@ Property / cites work: Complexity of Boolean algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic with bounded quantifier alternation
+Normal rank
@@ Property / cites work @@
+Complexity of Subcases of Presburger Arithmetic
@@ Property / cites work: Complexity of Subcases of Presburger Arithmetic / rank @@
+Normal rank
@@ Property / cites work @@
+Real addition and the polynomial hierarchy
@@ Property / cites work: Real addition and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories
+Normal rank