首页> 外文OA文献 >A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms

【2h】

A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms

机译：基于比较的算法的I / O复杂度的一般下界

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Lars Arge; Mikael Knudsen; Kirsten Larsen;
展开▼
作者单位

展开▼
年度 1993
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Comparison-based time-space lower bounds for selection [J] . Chan T.M. ACM transactions on algorithms . 2010,第2期

机译：基于比较的时空下限选择
2. Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime [J] . Sylvain Gelly, Sylvie Ruette, Olivier Teytaud Evolutionary computation . 2007,第4期

机译：基于比较的算法健壮，随机算法随时随地
3. Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem [J] . Guimaraes Dilson Almeida, da Cunha Alexandre Salles, Pereira Dilson Lucas European Journal of Operational Research . 2020,第1期

机译：SemideFinite编程下限和分支和绑定算法，用于二次最小生成树问题
4. Comparison-based time-space lower bounds for selection [C] . Timothy M. Chan Annual ACM-SIAM Symposium on Discrete Algorithms;ACM-SIAM Symposium on Discrete Algorithms . 2009

机译：基于比较的时空下限选择
5. An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing [D] . Scott, Jacob N. 2015

机译：所有递归矩阵乘法算法的I / O复杂度下界
6. Algorithms to estimate the lower bounds of recombination with or without recurrent mutations [O] . Xiaoming Liu, Yun-Xin Fu 2008

机译：估计有或没有复发突变的重组下限的算法
7. A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms [O] . Lars Arge, Mikael Knudsen, Kirsten Larsen 1992

机译：基于比较算法的I / O复杂度的一般下界

A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms

著录项

引文网络

相似文献

相关主题

期刊订阅