Unverified50% confidenceFactExact time
Brooks gave a frequently cited estimate: when the team size is n, the number of communication paths is n(n-1)/2.
1
Sources
50%
Confidence
Long-term
Relevance
10/27/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor a mini-batch of size N, sample-pair relation distillation requires computing N(N-1)/2 sample pairs, with a complexity of O(N²)64% similarUnverifiedQuicksort has an average time complexity of n log n and degrades to O(n²) in the worst case.57% similarUnverified对于长度为 n 的查询词和编辑距离 k，Levenshtein 自动机的状态数约为 O(n×(2k+1)^k)，随 k 增大呈指数级上升57% similarUnverifiedWithout caching, the total time complexity for N steps of generation is roughly on the order of N²·D² + N³·D.56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1102894API
curl https://kongchang.com/api/v1/knowledge/claims/1102894MCP
get_claim(id=1102894)