Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
