Polynomial Time Algorithms for Obtaining Permutation Distributions

Marcello Pagano and David L. Tritchler
Additional contact information
Marcello Pagano: Harvard University, Sidney Farber Cancer Institute
David L. Tritchler: Cornell University, Memorial Sloan Kettering Cancer Institute

A chapter in Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, 1981, pp 45-48 from Springer

Abstract: Abstract Polynomial time algorithms are presented for finding the permutation distribution of any statistic which is a linear combination of some function of either the original observations or the ranks. The algorithms require polynomial time as opposed to complete enumeration algorithms which require exponential time. This savings is effected by first calculating and then inverting the characteristic function of the statistic.

Keywords: Permutation distributions; Fast Fourier Transform; Non-parametrics (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9464-8_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461394648

DOI: 10.1007/978-1-4613-9464-8_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().