No occurrence obstructions in geometric complexity theory — mentioned by j2kun

Wed, 04 Jan 2017 06:42:20 GMT

There is a large, emerging body of research in which one proves the impossibility of solving problem A by finding an algorithm for solving a different problem B. For Mulmuley et al. (it's been a while since I was in the thick of this) it's finding an algorithm for computing a particular decomposition of a representation[1] having to do with determinants and permanents. This essentially shows the matrix permanent formula can't be written as a determinant of a small matrix (of smaller formulas of the variables), which is the "algebraic" analogue of P vs NP, and which Mulmuley et al. believe…

Paper and discussion history. A mention is not an endorsement.

No occurrence obstructions in geometric complexity theory · HackerPapers discussions

No occurrence obstructions in geometric complexity theory — mentioned by j2kun