On Inverting Permutation Tests
提出了多项式时间算法来逆运算单样本和两样本置换检验，从而得到位置参数或尺度变化的置信区间，并扩展到分层实验。
Abstract Polynomial time algorithms are presented for inverting permutation tests. The one-sample permutation test is inverted to make confidence statements about a location parameter, and the two-sample permutation test is inverted to make confidence statements concerning a shift in location or scale. These algorithms require polynomial time, as opposed to complete enumeration algorithms, which require exponential time. A computational method for the inversion of rank tests is also suggested. The algorithms extend to stratified experiments.