Assessing fast Fourier transform algorithms.
From MaRDI portal
Recommendations
Cites work
- A comparison of algorithms for exact analysis of unordered \(2\times K\) contingency tables
- A comparison of algorithms for exact goodness-of-fit tests for multinomial data
- A Note on Exact Analysis of Several 2 x 2 Tables
- A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data
- A survey of exact inference for contingency tables. With comments and a rejoinder by the author
- Algorithms for the Analysis of Several 2 \times 2 Contingency Tables
- An Algorithm for Exact Logistic Regression
- Analysis of discrete data: Rerandomization methods and complexity
- Computing Distributions for Exact Logistic Regression
- Fast Fourier transform and convolution algorithms
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- scientific article; zbMATH DE number 194921 (Why is no real title available?)
- Methods for Exact Goodness-of-Fit Tests
- On Obtaining Permutation Distributions in Polynomial Time
Cited in
(6)- An alternative way to compute Fourier amplitude sensitivity test (FAST).
- Use of the fast Fourier transform algorithm in the calculation of the operating characteristics of group sequential clinical trials
- A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data
- A comparison of algorithms for exact goodness-of-fit tests for multinomial data
- A comparison of algorithms for exact analysis of unordered \(2\times K\) contingency tables
- Time-series reconstruction from natural archive data with the Averaging effect taken into account
This page was built for publication: Assessing fast Fourier transform algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128616)