Separating NE from Some Nonuniform Nondeterministic Complexity Classes (Q5323096): Difference between revisions

@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+On sets Turing reducible to p-selective sets
@@ Property / cites work: On sets Turing reducible to p-selective sets / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On lower bounds of the closeness between complexity classes
+Normal rank
@@ Property / cites work @@
+Complete Problems and Strong Polynomial Reducibilities
+Normal rank
@@ Property / cites work @@
+Theory of semi-feasible algorithms
@@ Property / cites work: Theory of semi-feasible algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Computability and complexity theory
@@ Property / cites work: Computability and complexity theory / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
+Normal rank
@@ Property / cites work @@
+Separating classes in the exponential-time hierarchy from classes in PH
+Normal rank
@@ Property / cites work @@
+On the reducibility of sets inside NP to sets with low information content
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank
@@ Property / cites work @@
+On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
+Normal rank