On the linear classification of even and odd permutation matrices and the complexity of computing the permanent

DOI10.1134/S0965542517020038MaRDI QIDQ2359079zbMATH OpenWikidataFDO

Authors A. V. Babenko, Mikhail Vyalyi

Publication date 27 June 2017

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

permutation matrixKasteleyn algorithm

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15)

Recommendations

• Computing the permanent of (some) complex matrices
• scientific article; zbMATH DE number 1559555
• scientific article; zbMATH DE number 3930346
• scientific article; zbMATH DE number 4058868
• Computing the permanent modulo a prime power

Cites work

• scientific article; zbMATH DE number 1944141 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• scientific article; zbMATH DE number 3342868 (Why is no real title available?)
• Combinatorial theory.
• Computational Complexity
• Determinant: Old Algorithms, New Insights
• Linear Boolean Classification, Coding and the Critical Problem
• The complexity of computing the permanent

Cited in

(2)

• Counting the number of perfect matchings, and generalized decision trees
• A theory of even functionals and their algorithmic applications

This page was built for publication: On the linear classification of even and odd permutation matrices and the complexity of computing the permanent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359079)