Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171): Difference between revisions

@@ Property / cites work @@
+Q4256649
@@ Property / cites work: Q4256649 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321931
@@ Property / cites work: Q4321931 / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Fast parallel matrix and GCD computations
@@ Property / cites work: Fast parallel matrix and GCD computations / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of hard sparse sets under weak reductions
+Normal rank
@@ Property / cites work @@
+Q4252721
@@ Property / cites work: Q4252721 / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Problems complete for deterministic logarithmic space
+Normal rank
@@ Property / cites work @@
+Very Fast Parallel Polynomial Arithmetic
@@ Property / cites work: Very Fast Parallel Polynomial Arithmetic / rank @@
+Normal rank
@@ Property / cites work @@
+On log-tape isomorphisms of complete sets
@@ Property / cites work: On log-tape isomorphisms of complete sets / 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