Abstract
We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
