On membership comparable sets (Q1961377): Difference between revisions

@@ Property / cites work @@
+Q4230375
@@ Property / cites work: Q4230375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527016
@@ Property / cites work: Q4527016 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251059
@@ Property / cites work: Q4251059 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantifying the amount of verboseness
@@ Property / cites work: Quantifying the amount of verboseness / rank @@
+Normal rank
@@ Property / cites work @@
+Approximable sets
@@ Property / cites work: Approximable sets / rank @@
+Normal rank
@@ Property / cites work @@
+\(p\)-selective self-reducible sets: a new characterization of P
+Normal rank
@@ Property / cites work @@
+Enumerative counting is hard
@@ Property / cites work: Enumerative counting is hard / rank @@
+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 @@
+Short propositional formulas represent nondeterministic computations
+Normal rank
@@ Property / cites work @@
+Q4075484
@@ Property / cites work: Q4075484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252721
@@ Property / cites work: Q4252721 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4364576
@@ Property / cites work: Q4364576 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+\(p\)-Selective sets and reducing search to decision vs. self-reducibility
+Normal rank
@@ Property / cites work @@
+On self-reducibility and weak P-selectivity
@@ Property / cites work: On self-reducibility and weak P-selectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252720
@@ Property / cites work: Q4252720 / rank @@
+Normal rank
@@ Property / cites work @@
+On the density of families of sets
@@ Property / cites work: On the density of families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank
@@ Property / cites work @@
+Reductions on NP and p-selective sets
@@ Property / cites work: Reductions on NP and p-selective sets / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial problem; stability and order for models and theories in infinitary languages
+Normal rank
@@ Property / cites work @@
+On polynomial-time truth-table reducibility of intractable sets to P-selective sets
+Normal rank
@@ Property / cites work @@
+Q4942650
@@ Property / cites work: Q4942650 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3946078
@@ Property / cites work: Q3946078 / rank @@
+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