0

Note on 多项式

 3 years ago
source link: http://www.shuizilong.com/house/archives/note-on-%e5%a4%9a%e9%a1%b9%e5%bc%8f/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
neoserver,ios ssh client
September 22, 2021

hos.lyric 的模板

DFT：离散傅里叶变换
IDFT：离散傅里叶逆变换
FFT：A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).
NTT：快速数论变换
MTT：快速毛爷爷变换，毛爷爷对 FFT 的改进以解决任意模数
FWT：快速沃尔什变换
FMT：快速莫比乌斯变换

Posted by xiaodao
Category: 日常


report

Recommend

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK