Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690): Difference between revisions

@@ Property / author @@
+Ker-I. Ko
@@ Property / author: Ker-I. Ko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0890-5401(89)90029-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1968570030
@@ Property / OpenAlex ID: W1968570030 / rank @@
+Normal rank
@@ Property / cites work @@
+Sets with small generalized Kolmogorov complexity
@@ Property / cites work: Sets with small generalized Kolmogorov complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+On Sets Truth-Table Reducible to Sparse Sets
@@ Property / cites work: On Sets Truth-Table Reducible to Sparse Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse sets in NP-P
@@ Property / cites work: On sparse sets in NP-P / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / 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 @@
+A comparison of polynomial time completeness notions
+Normal rank