Characterizing parallel hierarchies by reducibilities (Q1183416): Difference between revisions

@@ Property / cites work @@
+Two Applications of Inductive Counting for Complementation Problems
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Recursive Predicates and Quantifiers
@@ Property / cites work: Recursive Predicates and Quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+On uniform circuit complexity
@@ Property / cites work: On uniform circuit complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel computation and the NC hierarchy relativized
+Normal rank
@@ Property / cites work @@
+On the Decomposability of $NC$ and $AC$
@@ Property / cites work: On the Decomposability of $NC$ and $AC$ / rank @@
+Normal rank