A low and a high hierarchy within NP (Q1052097): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(83)90027-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2011042573
@@ Property / OpenAlex ID: W2011042573 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
+Normal rank
@@ Property / cites work @@
+A second step toward the polynomial hierarchy
@@ Property / cites work: A second step toward the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Inclusion complete tally languages and the Hartmanis-Berman conjecture
+Normal rank
@@ Property / cites work @@
+Degrees of unsolvability: structure and theory
@@ Property / cites work: Degrees of unsolvability: structure and theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3929039
@@ Property / cites work: Q3929039 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / 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 @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+Q3915990
@@ Property / cites work: Q3915990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3931374
@@ Property / cites work: Q3931374 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Computationally Related Problems
@@ Property / cites work: Computationally Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Time Enumeration Reducibility
@@ Property / cites work: Polynomial Time Enumeration Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Q3942398
@@ Property / cites work: Q3942398 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3663288
@@ Property / cites work: Q3663288 / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform approach to obtain diagonal sets in complexity classes
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets and degrees
@@ Property / cites work: Recursively enumerable sets and degrees / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank