A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
The n 脳 n-permanent is not a projection of the m 脳 m-determinant if m ≤ √8/7 n - 1.