Pages that link to "Item:Q4286300"
From MaRDI portal
The following pages link to Approximating the permanent: A simple approach (Q4286300):
Displaying 21 items.
- Stochastic enumeration method for counting NP-hard problems (Q352890) (← links)
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- An upper bound for the permanent of \((0,1)\)-matrices. (Q1418984) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
- Efficient generation of random derangements with the expected distribution of cycle lengths (Q2204174) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Estimating the permanent by importance sampling from a finite population (Q2784184) (← links)
- Solution Counting Algorithms for Constraint-Centered Search Heuristics (Q3523086) (← links)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
- Matrix permanent and quantum entanglement of permutation invariant states (Q5245782) (← links)
- An algorithmic proof of Brégman–Minc theorem (Q5850764) (← links)
- Approximately Counting Embeddings into Random Graphs (Q5891884) (← links)
- Clifford algebras and approximating the permanent (Q5917579) (← links)
- Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)
