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

DOI10.1134/S0965542517020038zbMath1401.15008WikidataQ114075119 ScholiaQ114075119MaRDI QIDQ2359079

A. V. Babenko, Mikhail N. 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)

Related Items (1)

Counting the number of perfect matchings, and generalized decision trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Combinatorial theory.
• Linear Boolean Classification, Coding and the Critical Problem
• Determinant: Old Algorithms, New Insights
• Computational Complexity

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