This is the online version of the bagFFT algorithm described in:

Keich U. and Nagarajan N. A fast and numerically robust method for exact multinomial goodness-of-fit test. In Submission.

If you use this program in your research, please cite the above paper.
A C/C++ implementation of the algorithm (source code) for Unix/Linux machines is also available here: bagFFT.tar.gz.

---

You can use this form to directly enter parameter values:

N (Sample size)
K (Number of categories)
s (Log-Likelihood score)
Q (Lattice size)
π (Background frequencies)

Or use this form to upload a file of parameter values in the format "N K s Q π" as in this sample file:

Parameter file:

---

For questions and suggestions contact: niranjan at cs.cornell.edu