![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
A computational algorithm is given which calculates exact significance levels of a wide class of permutation tests in the one and two sample problems. This class includes the permutation test based on the means, locally most powerful permutation tests and linear rank tests. When a shift model is assumed confidence intervals can also be obtained. Approximate methods, based on asymptotic expansions, are also presented.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
