The orbit problem is in the GapL hierarchy (Q626456): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-009-9243-8
@@ Property / DOI: 10.1007/s10878-009-9243-8 / rank @@
-Normal rank
@@ Property / cites work @@
+The complexity of matrix rank and feasible systems of linear equations
+Normal rank
@@ Property / cites work @@
+Relationships among $PL$, $\#L$, and the determinant
+Normal rank
@@ Property / cites work @@
+The Orbit Problem Is in the GapL Hierarchy
@@ Property / cites work: The Orbit Problem Is in the GapL Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform constant-depth threshold circuits for division and iterated multiplication.
+Normal rank
@@ Property / cites work @@
+The complexity of the characteristic and the minimal polynomial.
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for the orbit problem
@@ Property / cites work: Polynomial-time algorithm for the orbit problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4221106
@@ Property / cites work: Q4221106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036702
@@ Property / cites work: Q4036702 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-009-9243-8
@@ Property / DOI: 10.1007/S10878-009-9243-8 / rank @@
+Normal rank