Pages that link to "Item:Q4522739"
From MaRDI portal
The following pages link to Polynomial algorithms for computing the permanents of some matrices (Q4522739):
Displaying 10 items.
- On the Pólya conversion problem for permanents and determinants (Q459468) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- On the permanental polynomials of matrices (Q745925) (← links)
- Computing permanents of complex diagonally dominant matrices and tensors (Q2317703) (← links)
- Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
- On minors and permanents of some (0,1)-matrices (Q3979855) (← links)
- The asymptotic behaviour of permanents of some (0, 1)-matrices (Q4522797) (← links)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
- (Q5396536) (← links)
- Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5901079) (← links)