Reduction in Complexity of the Algorithm by Increasing the Used Memory - An Example

来源 :美国计算数学期刊(英文) | 被引量 : 0次 | 上传用户:asdxxx123
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
An algorithm complexity, or its efficiency, meaning its time of evaluation is the focus of primary care in algorithmic problems solving. Raising the used memory may reduce the complexity of algorithm drastically. We present an example of two algorithms on
其他文献
内部会计控制制度的建设对强化企业内部会计监督,堵塞漏洞,消除隐患,保护财产安全,防止舞弊行为,促进经济活动健康发展具有重要意义.煤炭企业集团应从完善企业控制环境,实行
A new exact solution for nonlinear interaction of two pulsatory waves of the Korteweg-de Vries (KdV) equation is computed by decomposition in an invariant zigza
期刊
<正>~~
期刊
一、高校巨额贷款的成因1.迁移或合并扩建导致贷款需求。近十年内黑龙江省普通高等院校迁移、扩建的数量较多,例如黑龙江八一农垦大学在2003年从密山市整体搬迁至大庆市高新区,
据山西省科技厅网站消息,山西省“基于流态重构的超临界300-350 MW低热值煤循环流化床锅炉关键技术及装备开发”项目取得重大突破。
In light of the fact that no existing tree algorithms can guarantee the recombination property for general Ornstein-Uhlenbeck processes with time-dependent para