The following pages link to (Q5605168):
Displayed 50 items.
- Generating bricks (Q2642014) (← links)
- Arctic curves phenomena for bounded lecture Hall tableaux (Q2662864) (← links)
- Topological string amplitudes and Seiberg-Witten prepotentials from the counting of dimers in transverse flux (Q2684008) (← links)
- Graph coverings and twisted operators (Q2695962) (← links)
- Enumeration of perfect matchings of the Cartesian products of graphs (Q2699650) (← links)
- Limit shapes, real and imagined (Q2797788) (← links)
- A dimer ABC: (Q2811999) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- Complexity of Ising Polynomials (Q2911072) (← links)
- Spectral curves of periodic Fisher graphs (Q2939236) (← links)
- Dehn coloring and the dimer model for knots (Q2977922) (← links)
- Boundary partitions in trees and dimers (Q3085128) (← links)
- Identities between dimer partition functions on different surfaces (Q3302444) (← links)
- AMOEBAS AND INSTANTONS (Q3435292) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- On the Monomer–Dimer Problem of Some Graphs (Q3560181) (← links)
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120) (← links)
- Factors and factorizations of graphs—a survey (Q3714113) (← links)
- The Even Cycle Problem for Directed Graphs (Q3993798) (← links)
- On the evolution of random graphs over expanding square lattices (Q4107675) (← links)
- Characterizations of graphs having orientations satisfying local degree restrictions (Q4154884) (← links)
- Loop Groups, Clusters, Dimers and Integrable Systems (Q4609642) (← links)
- Dimer model: Full asymptotic expansion of the partition function (Q4687686) (← links)
- Probability distributions related to tilings of non-convex polygons (Q4687697) (← links)
- On the computational complexity of the Jones and Tutte polynomials (Q4712248) (← links)
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5009461) (← links)
- Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics (Q5056827) (← links)
- Families of convex tilings (Q5057806) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- (Q5111017) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- Classical Ising model test for quantum circuits (Q5131403) (← links)
- Random-link matching problems on random regular graphs (Q5135089) (← links)
- GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST (Q5213496) (← links)
- A matrix model for plane partitions (Q5220516) (← links)
- The geometry of dimer models (Q5234869) (← links)
- TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT (Q5292237) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)
- Monomer-dimer problem on random planar honeycomb lattice (Q5414765) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
- Circulant L-ensembles in the thermodynamic limit (Q5877987) (← links)
- Double interlacing in random tiling models (Q5885719) (← links)
- Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)