Sparse sets, approximable sets, and parallel queries to NP (Q294651): Difference between revisions

@@ Property / cites work @@
+Q4230375
@@ Property / cites work: Q4230375 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for the complexity of sparse and tally descriptions
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximable sets
@@ Property / cites work: Approximable sets / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+On the sparse set conjecture for sets with low density
+Normal rank
@@ Property / cites work @@
+On the existence of hard sparse sets under weak reductions
+Normal rank
@@ Property / cites work @@
+Q4359456
@@ Property / cites work: Q4359456 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252721
@@ Property / cites work: Q4252721 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing functions with parallel queries to NP
@@ Property / cites work: Computing functions with parallel queries to NP / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Membership Comparable Sets
@@ Property / cites work: Polynomial-Time Membership Comparable Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
+Normal rank
@@ Property / cites work @@
+Q4258565
@@ Property / cites work: Q4258565 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Some consequences of non-uniform conditions on uniform classes
+Normal rank