Pages that link to "Item:Q4705350"
From MaRDI portal
The following pages link to Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350):
Displaying 15 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Hafnians, perfect matchings and Gaussian matrices (Q317488) (← links)
- Convexity of the image of a quadratic map via the relative entropy distance (Q464812) (← links)
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- Immanants and finite point processes (Q1584658) (← links)
- Concentration of permanent estimators for certain large matrices. (Q1879920) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Noncommutativity makes determinants hard (Q2347802) (← links)
- A general law of large permanent (Q2362303) (← links)
- Fast algorithms of bath calculations in simulations of quantum system-bath dynamics (Q2701266) (← links)
- Estimating the permanent by importance sampling from a finite population (Q2784184) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- Stability and complexity of mixed discriminants (Q5207439) (← links)
