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

DOI10.1134/S0965542517020038zbMATH Open1401.15008WikidataQ114075119 ScholiaQ114075119MaRDI QIDQ2359079FDOQ2359079

Authors: A. V. Babenko, Mikhail Vyalyi 

Publication date: 27 June 2017

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

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

zbMATH Keywords

permutation matrixKasteleyn algorithm

Mathematics Subject Classification ID

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

Cites Work

• Computational Complexity
• Title not available (Why is that?)
• The complexity of computing the permanent
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial theory.
• Determinant: Old Algorithms, New Insights
• Linear Boolean Classification, Coding and the Critical Problem

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)