N-body problem 多体问题 ; N体问题
urban n problem 城市问题
Kelvin n problem 开尔文问题
neumann n problem 诺埃曼问题
location n problem 布局问题
estimation n problem 估计问题
n body problem 体问题 ; N体问题
n-queen problem 皇后问题
Consider also the n(n-1) integration problem.
同样考虑 n(n-1)集成问题。
Yet somehow, nature is able to simulate this mathematical problem using only N particles.
然而不知为什么,大自然能仅使用 N 粒子模拟这一数学问题。
Not all instances of the N+1 problem are as readily perceived.
并非所有的 N+1 问题都能很容易地察觉到。
Log n Log n, because at each stage I'm cutting the problem in half. So I start off with n then it's n n/2 n/4 n/8 over two n over four n over eight.
因为总共有多少层?,因为在每一层,我都是把问题分解成两半,因此以n开始,然后是。
So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?
因此一个输入为N的问题的运行时间,在这儿的公式表示为,如果输入为N,那么此算法的运行时间,是多少呢?
If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.
如果这个问题的规模,也就是n,是,如果这个问题是对数级的,这将会占据10纳秒的时间,你一眨眼的时间。
应用推荐