1. In this paper, we discuss the relation between master function and recursion, and the approach in solving recursive relation by master function.
本文论述了母函数与递归数列的关系,并探讨了用母函数求解递归数列的方法。

来自互联网

2. A recursive relation establishes a further one-to-many aggregation between a single Employee (the team leader) and many Employees (the team members).
递归的关系在单个Employee(团队领导)和许多Employee(团队成员)之间进一步建立起一对多的聚合。

来自互联网

3. The naive implementation of this recurrence relation as a recursive method would have led to an inefficient solution involving multiple computations of subproblems.
用递归方法对这些递归关系的直接实现会造成解决方案效率低下,因为其中包含了对子问题的多次计算。

来自互联网

4. The problem to find out all candidate keys of relation schema is solved satisfactorily. And a new recursive algorithm of finding out all candidate keys is given.
圆满地解决了关系模式全部候选关键字的求解问题,具体地给出了以递归形式的求全部候选关键字的新算法。

来自互联网

5. The problem to find out all candidate keys of relation schema is solved satisfactorily. And a new recursive algorithm of finding out all candidate keys is given.
圆满地解决了关系模式全部候选关键字的求解问题,具体地给出了以递归形式的求全部候选关键字的新算法。

来自互联网