ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS

被引：0
|
作者：
洪加威
机构：
[1] BeijingMunicipalComputingCentre
来源：
ScienceinChina,Ser.A. | 1979年 / Ser.A.1979卷 / 08期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
<正> In this paper, two classes of machines are defined, and the lower bounds of time complexity to compute some problems including sorting and searching on them are examined.
引用
收藏
页数：11
相关论文
共 50 条
  • [1] LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
    HONG, J
    [J]. SCIENTIA SINICA, 1979, 22 (08): : 890 - 900
  • [2] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
    洪加威
    [J]. Science China Mathematics, 1979, (08) : 890 - 900
  • [3] On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Extended Abstract)
    Fontaine, Allyx
    Metivier, Yves
    Robson, John Michael
    Zemmari, Akka
    [J]. SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 235 - 245
  • [4] Lower complexity bounds for interpolation algorithms
    Gimenez, Nardo
    Heintz, Joos
    Matera, Guillermo
    Solerno, Pablo
    [J]. JOURNAL OF COMPLEXITY, 2011, 27 (02) : 151 - 187
  • [5] Propositional lower bounds: Algorithms and complexity
    Cadoli, M
    Palopoli, L
    Scarcello, F
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 27 (1-4) : 129 - 148
  • [6] Propositional lower bounds: Algorithms and complexity
    Marco Cadoli
    Luigi Palopoli
    Francesco Scarcello
    [J]. Annals of Mathematics and Artificial Intelligence, 1999, 27 : 129 - 148
  • [7] LOWER BOUNDS ON THE WORST-CASE COMPLEXITY OF SOME ORACLE ALGORITHMS
    HAUSMANN, D
    KORTE, B
    [J]. DISCRETE MATHEMATICS, 1978, 24 (03) : 261 - 276
  • [8] Connecting SAT Algorithms and Complexity Lower Bounds
    Williams, Ryan
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011, 2011, 6695 : 1 - 2
  • [9] On Fast Polynomial Algorithms and Lower Bounds of the Linear Complexity
    李磊
    [J]. Chinese Quarterly Journal of Mathematics, 1996, (02) : 1 - 4
  • [10] Some lower bounds for the complexity of continuation methods
    Dedieu, JP
    Smale, S
    [J]. JOURNAL OF COMPLEXITY, 1998, 14 (04) : 454 - 465
12345