Permanent v. Determinant

DOI10.1145/2840728.2840735zbMath1334.68090OpenAlexW2293763217MaRDI QIDQ2800550

Nicolas Ressayre, Joseph M. Landsberg

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2840728.2840735

zbMATH Keywords

determinantpermanentgeometric complexity theory

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Permanent v. Determinant