The number of matrices with nonzero permanent over a finite field
From MaRDI portal
Publication:1662013
DOI10.1007/S10958-018-3904-ZzbMATH Open1417.15008OpenAlexW2811161681MaRDI QIDQ1662013FDOQ1662013
Publication date: 17 August 2018
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-018-3904-z
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Pólya's permanent problem
- Combinatorial matrix theory
- The complexity of computing the permanent
- The complexity of theorem-proving procedures
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- On the Pólya permanent problem over finite fields
- Permanent has less zeros than determinant over finite fields
- A relation between the determinant and the permanent on singular matrices
- On the number of nonzero permanents over a finite field of odd characteristic
Cited In (3)
This page was built for publication: The number of matrices with nonzero permanent over a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662013)