chapter_computational_complexity/ #532
giscus[bot]
bot
Replies: 64 comments 14 replies
-
|
这个网站是哪个框架搭的？ |
Beta Was this translation helpful? Give feedback.
-
|
mkdocs material |
Beta Was this translation helpful? Give feedback.
-
|
插图AI生成的吗，好评 |
Beta Was this translation helpful? Give feedback.
-
|
是的！ |
Beta Was this translation helpful? Give feedback.
-
|
是mj吗？prompt是什么 |
Beta Was this translation helpful? Give feedback.
-
|
应该如何获得这张图片真的很喜欢 |
Beta Was this translation helpful? Give feedback.
-
|
右键保存～ |
Beta Was this translation helpful? Give feedback.
-
|
网站有书签功能吗，看到哪里总忘 |
Beta Was this translation helpful? Give feedback.
-
|
暂时没有哦 |
Beta Was this translation helpful? Give feedback.
-
|
要完成这个功能需要记录cookie吧 |
Beta Was this translation helpful? Give feedback.
-
|
比起「时空向导」，在学习的时候，感觉时间和空间复杂度更像是评价「算法」的两个“评价维度”，就好像我们在评价不同学生的时候，会用学习能力、道德品质、运动健康等维度进行评价。 |
Beta Was this translation helpful? Give feedback.
-
|
时空是两个维度，角色是“向导”。这是因为算法研究的总体目标就是降低时间与空间复杂度，实现又快又省的算法。 |
Beta Was this translation helpful? Give feedback.
-
|
原来如此，明白啦 k 大 |
Beta Was this translation helpful? Give feedback.
-
|
hao |
Beta Was this translation helpful? Give feedback.
-
|
Hi 派大星 |
Beta Was this translation helpful? Give feedback.
-
|
膜拜大佬 |
Beta Was this translation helpful? Give feedback.
-
|
我有一个问题是最近在学习李沐老师《动手学深度学习》中自注意力机制时有一页是用来比较CNN、RNN和self-attention的计算复杂度，我不太清楚其中处理序列数据的CNN和RNN网络的计算复杂度是如何算的，K神可以解答下吗 |
Beta Was this translation helpful? Give feedback.
-
|
Hi，这个书中介绍的挺详细的，在“10.6.2 比较卷积神经网络、循环神经网络和自注意力”。推荐也可以看看李沐老师的 B 站视频讲解。 |
Beta Was this translation helpful? Give feedback.
-
以上是原文。这里推算技巧就是不要考虑序列的边界，将序列中的 n 个节点都想象成一样的，那么就是直接乘起来就可以了。 |
Beta Was this translation helpful? Give feedback.
-
|
这里我的理解是，假定没有padding，步长为1，卷积核为ddk*1，卷积核运算的次数是n-k+1次，一般情况下n远大于k，所以这里是knd^2。不知道这样理解对不对k神 |
Beta Was this translation helpful? Give feedback.
-
|
打卡9 |
Beta Was this translation helpful? Give feedback.
-
|
打卡 |
Beta Was this translation helpful? Give feedback.
-
|
小王匠打卡 |
Beta Was this translation helpful? Give feedback.
-
|
打卡 |
Beta Was this translation helpful? Give feedback.
-
|
2024.1.26 mark |
Beta Was this translation helpful? Give feedback.
-
|
2024.02.22 mark，go for it |
Beta Was this translation helpful? Give feedback.
-
|
打卡 |
Beta Was this translation helpful? Give feedback.
-
|
2024.3.16 |
Beta Was this translation helpful? Give feedback.
-
|
2025/2/23 打卡第二章 |
Beta Was this translation helpful? Give feedback.
-
|
动手！ |
Beta Was this translation helpful? Give feedback.
-
|
2025/4/15打卡 |
Beta Was this translation helpful? Give feedback.
-
|
一般不是都从数据结构数组链表这些开始的吗？怎么作者会选择以复杂度分析先开始。虽然我觉得这样挺好 |
Beta Was this translation helpful? Give feedback.
-
|
有种时间法则和空间法则即视感 |
Beta Was this translation helpful? Give feedback.
-
|
第一天打卡 |
Beta Was this translation helpful? Give feedback.
-
|
打卡 |
Beta Was this translation helpful? Give feedback.
-
|
打卡 |
Beta Was this translation helpful? Give feedback.
-
|
打卡 |
Beta Was this translation helpful? Give feedback.
-
|
2025年8月20日开始学习，记录打卡！ |
Beta Was this translation helpful? Give feedback.
-
|
打卡！ |
Beta Was this translation helpful? Give feedback.
-
|
打卡！ |
Beta Was this translation helpful? Give feedback.
-
|
2025.11.16 武大梁再次启动！！！ |
Beta Was this translation helpful? Give feedback.
-
|
建议加一个，一键复制粘贴键，复制代码，谢谢作者大大 |
Beta Was this translation helpful? Give feedback.
-
|
Hi，代码框右上角应该有复制按键哈： |
Beta Was this translation helpful? Give feedback.
-
|
樊丰坤 打卡留念 |
Beta Was this translation helpful? Give feedback.
and others
Uh oh!
There was an error while loading. Please reload this page.
-
chapter_computational_complexity/
一本动画图解、能运行、可提问的数据结构与算法入门书
https://www.hello-algo.com/chapter_computational_complexity/
Beta Was this translation helpful? Give feedback.
All reactions