2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2019
Faster Integer Multiplication Using Preprocessing
Matt Groff
A New Number Theoretic Transform(NTT), which is a form of FFT, is introduced, that is faster than FFTs. Also, a multiplication algorithm is introduced that uses this to perform int…
cs.DS2019
The Polynomial Transform
Matt Groff
We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size transform takes operations. In the multitape Turing mac…
cs.DS2011★ 2 cited
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Matt Groff
The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is prese…