TIGHT LOWER BOUNDS ON THE LENGTH OF WORD CHAINS

被引：4
|
作者：
ALTHOFER, I
机构：
[1] Fakultät für Mathematik, Universität Bielefeld, 4800 Bielefeld 1
来源：
INFORMATION PROCESSING LETTERS | 1990年 / 34卷 / 05期
关键词：
addition chain; de Bruijn-sequence; Word;
D O I：
10.1016/0020-0190(90)90136-L
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：275 / 276
页数：2
相关论文
共 50 条
  • [21] Towards Tight Lower Bounds for Scheduling Problems
    Bazzi, Abbas
    Norouzi-Fard, Ashkan
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 118 - 129
  • [22] First Lower Bounds for Palindromic Length
    Frid, Anna E.
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2019, 2019, 11647 : 234 - 243
  • [23] Length Bounds on Curves Arising from Tight Geodesics
    Brian H. Bowditch
    [J]. Geometric and Functional Analysis, 2007, 17 : 1001 - 1042
  • [24] Length bounds on curves arising from tight geodesics
    Bowditch, Brian H.
    [J]. GEOMETRIC AND FUNCTIONAL ANALYSIS, 2007, 17 (04) : 1001 - 1042
  • [25] Lower and upper bounds for reversible Markov chains
    Delmotte, T
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1997, 324 (09): : 1053 - 1058
  • [26] Tight Conditional Lower Bounds for Vertex Connectivity Problems
    Huang, Zhiyi
    Long, Yaowei
    Saranurak, Thatchaphol
    Wang, Benyu
    [J]. PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1384 - 1395
  • [27] Tight Lower Bounds for the Size of Epsilon-Nets
    Pach, Janos
    Tardos, Gabor
    [J]. COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 458 - 463
  • [28] Towards Tight Communication Lower Bounds for Distributed Optimisation
    Alistarh, Dan
    Korhonen, Janne H.
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021,
  • [29] Tight lower bounds for the longest common extension problem
    Kosolobov, Dmitry
    [J]. INFORMATION PROCESSING LETTERS, 2017, 125 : 26 - 29
  • [30] TIGHT CHIP AREA LOWER BOUNDS FOR STRING MATCHING
    SYKORA, O
    VRTO, I
    [J]. INFORMATION PROCESSING LETTERS, 1987, 26 (03) : 117 - 119
12345