The following pages link to Igor Pak (Q187137):
Displaying 5 items.
- Lifting Markov chains to speed up mixing (Q2819554) (← links)
- Log-concave poset inequalities (Q6504725) (← links)
- Positivity of the symmetric group characters is as hard as the polynomial time hierarchy (Q6506233) (← links)
- Computational complexity of counting coincidences (Q6512549) (← links)
- Linear extensions and continued fractions (Q6517884) (← links)
