ON THE AVERAGE TIME-COMPLEXITY OF SET PARTITIONING

被引:0
|
作者
SPECKENMEYER, E [1 ]
KEMP, R [1 ]
机构
[1] UNIV DORTMUND, FACHBEREICH INFORMAT, W-4600 DORTMUND 50, GERMANY
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:369 / 381
页数:13
相关论文
共 50 条
  • [41] TIME-COMPLEXITY OF LOOP-FREE 2-WAY PUSHDOWN-AUTOMATA
    RYTTER, W
    INFORMATION PROCESSING LETTERS, 1983, 16 (03) : 127 - 129
  • [42] A TIME-COMPLEXITY GAP FOR 2-WAY PROBABILISTIC FINITE-STATE AUTOMATA
    DWORK, C
    STOCKMEYER, L
    SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1011 - 1023
  • [43] On the complexity of some Euclidean problems of partitioning a finite set of points
    Kel'manov, A. V.
    Pyatkin, A. V.
    DOKLADY MATHEMATICS, 2016, 94 (03) : 635 - 638
  • [44] On the complexity of some Euclidean problems of partitioning a finite set of points
    A. V. Kel’manov
    A. V. Pyatkin
    Doklady Mathematics, 2016, 94 : 635 - 638
  • [45] Average case polyhedral complexity of the maximum stable set problem
    Gábor Braun
    Samuel Fiorini
    Sebastian Pokutta
    Mathematical Programming, 2016, 160 : 407 - 431
  • [46] Average case polyhedral complexity of the maximum stable set problem
    Braun, Gabor
    Fiorini, Samuel
    Pokutta, Sebastian
    MATHEMATICAL PROGRAMMING, 2016, 160 (1-2) : 407 - 431
  • [47] The Average State Complexity of the Star of a Finite Set of Words Is Linear
    Bassino, Frederique
    Giambruno, Laura
    Nicaud, Cyril
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 134 - +
  • [48] TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM (2ND PRINTING)
    ANTONIO, JK
    TSAI, WK
    HUANG, GM
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (09) : 1839 - 1844
  • [49] On the average time complexity of computation with random partition
    Mingxue Liao
    Pin Lv
    Computing, 2024, 106 : 741 - 758
  • [50] On the average time complexity of computation with random partition
    Liao, Mingxue
    Lv, Pin
    COMPUTING, 2024, 106 (03) : 741 - 758