« first day (1218 days earlier)   

12:03 AM
FFT computes the DFT with less multiplications using the divide and conquer procedure.
While the DFT needs N^2 multiplications, FFT neds only NlogN multiplications.

Is this correct?
@vzn
@RickDecker Ok... I will try it again... Thanks for the clarification!!
 
 
1 hour later…
1:22 AM
3
Q: How much bigger can an LR(1) automaton for a language be than the corresponding LR(0) automaton?

templatetypedefIn an LR(0) parser, each state consists of a collection of LR(0) items, which are productions annotated with a position. In an LR(1) parser, each state consists of a collection of LR(1) items, which are productions annotated with a position and a lookahead character. It's known that given a stat...

 
vzn
@MaryStar right. FFT concept shows up all over CS/ math. not an expert but presumably the poly eval at fixed set of pts is using the same principle. presumably a good ref would show the correspondence.
 

« first day (1218 days earlier)