TREE ENUMERATION AND TREE ALGORITHM COMPLEXITY COMPUTATION

来源 :中国科学通报:英文版 | 被引量 : 0次 | 上传用户:mmllpp000
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Algorithm complexity analysis over tree structures has drawn much attention in recent years. Ph. Flajolet made the complexity analysis for recursive descent algorithm over trees by establishing a complexity measure table for constructions in a formal tree
其他文献
The near-rings in this letter always stand for zero-symmetric left nor-rings. An additive endomorphism D of a near-ring N is called a derivation on N if D(xy) =
Let Δ(a<sub>,</sub> ……, a<sub>k</sub>; x) denote the error term in the asymptotic formula for the summatory function of d(a<sub>1</sub>, …, a<sub>k</sub>; n), w
做习题时遇到下面这样一道题. 题目若实数a,b,x,y满足a2+b2=m,x2+y2=n,求ax+by的最大值.我用了两种解法都能简单算出结果. 解法1 根据基本不等式即 得 解法2 根据柯西
In laying routes on printed circuit boards and VLSI chips, wires are usually allowed to run rectilinearly. This makes people consider the number of intersection
The invariant subspace forms of cyclic self-adjoint operators on Hilbet spaces are quite clear, but the invariant subspace forms of cyclic self-adjoint operator
Let F be a field and V= V<sub>n</sub>(F)={(a<sub>1</sub>,…, a<sub>n</sub>)|a<sub>i</sub>∈F} be the row vector space of finite dimension n over F. Let be a finite
Ⅰ. INTRODUCTIONThe Mbius inversion formula in number theory has been modified recently by Chen to account for the continuous variables such that
人教版初三几何课本关于圆一章的例题,有四处标有“注意”的叙述文字,它给出了添加辅助线的规律,为了帮助同学们正确理解、灵 There are four descriptive texts marked wit
In this letter,we study the semilinear two-point boundary value problem u〃(x)+u(x)+g(x,u(x))=h(x),U(0)=u(π)=0 ,where h∈L~2(0,π) and g: (0, π)&#215;R→R are
The transient behavior of a semiconductor device is described by a system of three quasilinear partial differential equations: one elliptic in form for the elec