algorithm | 26th parallel south | 10th parallel south | RSA (algorithm) | 34th parallel north | 31st parallel south | Parallel universe (fiction) | 9th parallel north | 11th parallel north | Parallel computing | parallel | 5th parallel south | 41st parallel south | 40th parallel south | Secure Hash Algorithm | 40th parallel north | 35th parallel south | 28th parallel south | 45th parallel north | 20th parallel south | 18th parallel south | 15th parallel north | 10th parallel north | Parallel Lives | 41st parallel north | 39th parallel north | 38th parallel south | 38th parallel north | 37th parallel south | 36th parallel south |
The computational complexity of the permanent also has some significance in other aspects of complexity theory: it is not known whether NC equals P (informally, whether every polynomially-solvable problem can be solved by a polylogarithmic-time parallel algorithm) and Ketan Mulmuley has suggested an approach to resolving this question that relies on writing the permanent as the determinant of a matrix.