On resource-bounded instance complexity (Q1351945): Difference between revisions

@@ Property / cites work @@
+Polynomial terse sets
@@ Property / cites work: Polynomial terse sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996675
@@ Property / cites work: Q3996675 / rank @@
+Normal rank
@@ Property / cites work @@
+Random strings make hard instances
@@ Property / cites work: Random strings make hard instances / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281495
@@ Property / cites work: Q4281495 / 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 @@
+On reductions of NP sets to sparse sets
@@ Property / cites work: On reductions of NP sets to sparse sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the notion of infinite pseudorandom sequences
@@ Property / cites work: On the notion of infinite pseudorandom sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q4727431
@@ Property / cites work: Q4727431 / rank @@
+Normal rank
@@ Property / cites work @@
+Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
+Normal rank
@@ Property / cites work @@
+Q4023358
@@ Property / cites work: Q4023358 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost every set in exponential time is P-bi-immune
+Normal rank
@@ Property / cites work @@
+Instance complexity
@@ Property / cites work: Instance complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank
@@ Property / cites work @@
+On one-one polynomial time equivalence relations
@@ Property / cites work: On one-one polynomial time equivalence relations / rank @@
+Normal rank