AVERAGE COMPLEXITY OF DIVIDE-AND-CONQUER ALGORITHMS

被引：1
|
作者：
VEROY, BS
机构：
来源：
INFORMATION PROCESSING LETTERS | 1988年 / 29卷 / 06期
关键词：
D O I：
10.1016/0020-0190(88)90232-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：319 / 326
页数：8
相关论文
共 50 条
  • [41] PIPELINES FOR DIVIDE-AND-CONQUER FUNCTIONS
    DEGUZMAN, IP
    HARRISON, PG
    MEDINA, E
    [J]. COMPUTER JOURNAL, 1993, 36 (03): : 254 - 268
  • [42] DIVIDE-AND-CONQUER YOUR DATABASE
    LIVINGSTON, D
    [J]. SYSTEMS INTEGRATION BUSINESS, 1991, 24 (05): : 43 - 45
  • [43] DIVIDE-AND-CONQUER FOR PARALLEL PROCESSING
    HOROWITZ, E
    ZORAT, A
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (06) : 582 - 585
  • [44] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    [J]. FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [45] PRUNING DIVIDE-AND-CONQUER NETWORKS
    ROMANIUK, SG
    [J]. NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1993, 4 (04) : 481 - 494
  • [46] DIVIDE-AND-CONQUER NEURAL NETWORKS
    ROMANIUK, SG
    HALL, LO
    [J]. NEURAL NETWORKS, 1993, 6 (08) : 1105 - 1116
  • [47] CUTTING HYPERPLANES FOR DIVIDE-AND-CONQUER
    CHAZELLE, B
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (02) : 145 - 158
  • [48] Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
    Amato, NM
    Goodrich, MT
    Ramos, EA
    [J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 705 - 706
  • [49] Hybrid divide-and-conquer approach for tree search algorithms : possibilities and limitations
    Rennela, Mathys
    Brand, Sebastiaan
    Laarman, Alfons
    Dunjko, Vedran
    [J]. QUANTUM, 2023, 7 : 1 - 48
  • [50] New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem
    Li, Shengguo
    Liao, Xiangke
    Liu, Jie
    Jiang, Hao
    [J]. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2016, 23 (04) : 656 - 673
12345