Undecidability results for low complexity time classes (Q1567411): Difference between revisions

@@ Property / cites work @@
+Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
+Normal rank
@@ Property / cites work @@
+Q3778006
@@ Property / cites work: Q3778006 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of the polynomial many-one degrees of recursive sets is undecidable
+Normal rank
@@ Property / cites work @@
+Q4268494
@@ Property / cites work: Q4268494 / rank @@
+Normal rank
@@ Property / cites work @@
+Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice-theoretic decision problems in universal algebra
+Normal rank
@@ Property / cites work @@
+Relativized polynomial hierarchies extending two levels
+Normal rank
@@ Property / cites work @@
+Q4003410
@@ Property / cites work: Q4003410 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of sets in NP and other complexity classes
+Normal rank
@@ Property / cites work @@
+Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank