The following pages link to Chao Liao (Q2166748):
Displaying 8 items.
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line (Q2798726) (← links)
- Zeros of Holant Problems (Q5028341) (← links)
- Counting hypergraph colourings in the local lemma regime (Q5230351) (← links)
- Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
- Zeros of Holant problems: locations and algorithms (Q5236324) (← links)
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs (Q5875490) (← links)
- Almost tight approximation hardness for single-source directed \(k\)-edge-connectivity (Q6560887) (← links)
