New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

你这个算法时间复杂度大概是多少呢 #8

Open

yanjinYoungOG opened this issue Jun 23, 2024 · 1 comment

yanjinYoungOG commented Jun 23, 2024

No description provided.

Owner

tianzhou2011 commented Jun 24, 2024 via email

可以是O(N)的，投影这步是O(N）快速傅立叶是Nlog(N),但如果假设前面投影投到固定C，那就是O(N)+ClogC，但如果投影到的向量数和N要线性相关，那就是O(NlogN)

On Sun, Jun 23, 2024 at 5:05 PM yanjinYoungOG ***@***.***> wrote: — Reply to this email directly, view it on GitHub <#8>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AB3JGO72VQSADVIT2W6BJDDZI2FUZAVCNFSM6AAAAABJYF7WHCVHI2DSMVQWIX3LMV43ASLTON2WKOZSGM3DQNBVG4YDKMI> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment