Unverified50% confidenceFactExact time
传统NMS的时间复杂度为O(N²)，YOLOv11对于640×640输入会产生8400个候选框，密集场景下NMS计算量增加
1
Sources
50%
Confidence
Long-term
Relevance
8/12/2026
First Seen
Sources
Related Claims
UnverifiedThe computational complexity of liquid convolution scales linearly with sequence length at O(n), rather than the quadratic O(n²) of self-attention, resulting in approximately 1/1000 the computation of attention layers when processing 128K tokens.64% similarUnverifiedNVMe协议支持高达65535个命令队列，SATA的AHCI接口命令队列深度仅32，NVMe SSD随机4K读取速度通常是SATA SSD的10倍以上61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/736791API
curl https://kongchang.com/api/v1/knowledge/claims/736791MCP
get_claim(id=736791)