The following pages link to (Q3703292):
Displaying 12 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Computing sparse permanents faster (Q1044712) (← links)
- A note on the permanent value problem (Q1198001) (← links)
- A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- The permanent of 0-1 matrices and Kallman's algorithm (Q1971539) (← links)
- Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
- On Leonid Gurvits’s Proof for Permanents (Q3069248) (← links)
- A Monte-Carlo Algorithm for Estimating the Permanent (Q4032938) (← links)
- Polynomial algorithms for computing the permanents of some matrices (Q4522739) (← links)
- Below all subsets for some permutational counting problems (Q5369519) (← links)
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents (Q5932755) (← links)