Pages that link to "Item:Q1124882"
From MaRDI portal
The following pages link to How fast can one compute the permanent of circulant matrices? (Q1124882):
Displayed 7 items.
- On prime factors of determinants of circulant matrices (Q1044588) (← links)
- On the number of different permanents of some sparse (0,1)-circulant matrices. (Q1414708) (← links)
- Computation of sparse circulant permanents via determinants (Q1855364) (← links)
- On the parity of permanents of circulant matrices (Q2479510) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- On the values of permanents of (0, 1) circulant matrices with three ones per row (Q2568378) (← links)
- Inductive proof of Borchardt's theorem (Q6189869) (← links)