REFINED BOUNDS ON THE COMPLEXITY OF SORTING AND SELECTION IN D - DIMENSIONAL SPACE

被引：0
|
作者：
FISCHER, TM
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 233卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：308 / 314
页数：7
相关论文
共 50 条
  • [21] Regret Bounds for Online Kernel Selection in Continuous Kernel Space
    Zhang, Xiao
    Liao, Shizhong
    Xu, Jun
    Wen, Ji-Rong
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 10931 - 10938
  • [22] Tight complexity bounds for the two-dimensional real knapsack problem
    Brimkov, VE
    Dantchev, SS
    Leoncini, M
    CALCOLO, 1999, 36 (02) : 123 - 128
  • [23] Comparison-Based Time Space Lower Bounds for Selection
    Chan, Timothy M.
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 140 - 149
  • [24] Complexity bounds on quantum search algorithms in finite-dimensional networks
    Boettcher, Stefan
    Li, Shanshan
    Fernandes, Tharso D.
    Portugal, Renato
    PHYSICAL REVIEW A, 2018, 98 (01)
  • [25] Integration bounds for the regular simplex inn-dimensional space
    Williams, David M.
    Walters, Gage S.
    INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY, 2021, 52 (08) : 1260 - 1275
  • [26] Exponential lower bounds on the space complexity of OBDD-based graph algorithms
    Sawitzki, D
    LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 781 - 792
  • [27] Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
    Alias, Christophe
    Darte, Alain
    Feautrier, Paul
    Gonnord, Laure
    STATIC ANALYSIS, 2010, 6337 : 117 - +
  • [28] Comparison-Based Time-Space Lower Bounds for Selection
    Chan, Timothy M.
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [29] Performance bounds for space-time block codes with antenna selection
    Zeng, XN
    Ghrayeb, A
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 341 - 341
  • [30] ON THE COMPLEXITY OF D-DIMENSIONAL VORONOI DIAGRAMS
    KLEE, V
    ARCHIV DER MATHEMATIK, 1980, 34 (01) : 75 - 80
12345