The following pages link to Approximating the Permanent (Q3211352):
Displaying 50 items.
- A permanent formula with many zero-valued terms (Q287124) (← links)
- Decentralized dynamics for finite opinion games (Q313975) (← links)
- Hafnians, perfect matchings and Gaussian matrices (Q317488) (← links)
- Convergence to equilibrium of logit dynamics for strategic games (Q334931) (← links)
- Logarithmic Sobolev, isoperimetry and transport inequalities on graphs (Q335316) (← links)
- Dynamics of \((2+1)\)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion (Q400570) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- Uniform estimates of nonlinear spectral gaps (Q497347) (← links)
- Matchings in vertex-transitive bipartite graphs (Q502979) (← links)
- The worm process for the Ising model is rapidly mixing (Q504198) (← links)
- On the permanents of circulant and degenerate Schur matrices (Q512073) (← links)
- Approximately counting paths and cycles in a graph (Q516844) (← links)
- Tilings of rectangles with T-tetrominoes (Q596042) (← links)
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- Nash inequalities for finite Markov chains (Q678089) (← links)
- Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- Relation-algebraic computation of fixed points with applications (Q817578) (← links)
- Discrete quantitative nodal theorem (Q820852) (← links)
- Multiconsistency and robustness with global constraints (Q857890) (← links)
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- Fast uniform generation of regular graphs (Q909471) (← links)
- Simulated annealing: A tool for operational research (Q913662) (← links)
- Explicit error bounds for lazy reversible Markov chain Monte Carlo (Q998975) (← links)
- Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions (Q1024904) (← links)
- Sampling Eulerian orientations of triangular lattice graphs (Q1026226) (← links)
- Censored Glauber dynamics for the mean field Ising model (Q1047946) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Computational complexity of loss networks (Q1318715) (← links)
- Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region (Q1325572) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- Recent developments and problems in the domain of random generation (Q1351205) (← links)
- Coupling, spectral gap and related topics. II (Q1375818) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- Computing the permanent by importance sampling method. (Q1385764) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Expanding and forwarding parameters of product graphs (Q1421485) (← links)
- A discipline of evolutionary programming (Q1575454) (← links)
- Latent semantic indexing: A probabilistic analysis (Q1591153) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- Random cluster dynamics for the Ising model is rapidly mixing (Q1650104) (← links)
- Spectral gap estimates in mean field spin glasses (Q1663619) (← links)
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions (Q1663879) (← links)
- T-tetrominoes Tiling's Markov chain mixes fast (Q1694722) (← links)
- Sampling contingency tables (Q1713620) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
