The following pages link to Jiabao Lin (Q2075392):
Displaying 5 items.
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- (Q5111359) (← links)
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs (Q5875490) (← links)
