The following pages link to Approximating the Permanent (Q3211352):
Displaying 50 items.
- Analyzing Glauber dynamics by comparison of Markov chains (Q2737887) (← links)
- Estimating the permanent by importance sampling from a finite population (Q2784184) (← links)
- A load balancing strategy for parallel computation of sparse permanents. (Q2864488) (← links)
- Approximating the permanent via nonabelian determinants (Q2903520) (← links)
- Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets (Q2941178) (← links)
- Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs (Q2942665) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- Error bounds for computing the expectation by Markov chain Monte Carlo (Q3068187) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on R<sup><i>n</i></sup> (Q3147441) (← links)
- Sampling Edge Covers in 3-Regular Graphs (Q3182920) (← links)
- The first two largest eigenvalues of Laplacian, spectral gap problem and Cheeger constant of graphs (Q3382061) (← links)
- Mixing of the Glauber dynamics for the ferromagnetic Potts model (Q3467578) (← links)
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571) (← links)
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models (Q3608304) (← links)
- (Q3703292) (← links)
- Approximating the permanent: A simple approach (Q4286300) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow (Q4291194) (← links)
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146) (← links)
- A Possible Permanent Formula (Q4324583) (← links)
- Estimation of spectral gap for Markov chains (Q4332300) (← links)
- Markov-chain monte carlo: Some practical implications of theoretical results (Q4399495) (← links)
- Conductance bounds on the <i>L</i><sup>2</sup> convergence rate of Metropolis algorithms on unbounded state spaces (Q4464174) (← links)
- Isoperimetry in integer lattices (Q4645032) (← links)
- A semidefinite bound for mixing rates of Markov chains (Q4645923) (← links)
- The Tutte polynomial (Q4704790) (← links)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
- An Almost <i>m</i>-wise Independent Random Permutation of the Cube (Q4715261) (← links)
- Coupling vs. conductance for the Jerrum-Sinclair chain (Q4761354) (← links)
- Uniform sampling of<i>k</i>-hypertournaments (Q4908164) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- Randomly coloring graphs of logarithmically bounded pathwidth (Q5009556) (← links)
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
- Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices (Q5020837) (← links)
- (Q5090424) (← links)
- (Q5090447) (← links)
- The complexity of approximating the matching polynomial in the complex plane (Q5091171) (← links)
- Approximability of the eight-vertex model (Q5092451) (← links)
- Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing (Q5096108) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
- GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST (Q5213496) (← links)
- (Q5214254) (← links)
- Approximating real-rooted and stable polynomials, with combinatorial applications (Q5216314) (← links)
- An asymptotic approximation for the permanent of a doubly stochastic matrix (Q5219240) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability (Q5232317) (← links)
- Matrix permanent and quantum entanglement of permutation invariant states (Q5245782) (← links)
