Pages that link to "Item:Q4032938"
From MaRDI portal
The following pages link to A Monte-Carlo Algorithm for Estimating the Permanent (Q4032938):
Displayed 18 items.
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
- Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
- Computing the permanent by importance sampling method. (Q1385764) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- Computing the optimal partition of variables in multi-homogeneous homotopy methods (Q1774889) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
- A hybrid algorithm for multi-homogeneous Bézout number (Q2383696) (← links)
- Estimating the permanent by importance sampling from a finite population (Q2784184) (← links)
- (Q4705350) (← links)
- An algorithmic proof of Brégman–Minc theorem (Q5850764) (← links)
- Clifford algebras and approximating the permanent (Q5917579) (← links)