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 条
  • [31] Tight lower bounds for minimum weight triangulation heuristics
    Levcopoulos, C
    Krznaric, D
    [J]. INFORMATION PROCESSING LETTERS, 1996, 57 (03) : 129 - 135
  • [32] Tight upper and lower bounds on suffix tree breadth
    Badkobeh, Golnaz
    Gawrychowski, Pawel
    Kaerkkaeinen, Juha
    Puglisi, Simon J.
    Zhukova, Bella
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 854 (854) : 63 - 67
  • [33] TIGHT LOWER BOUNDS FOR THE SIZE OF EPSILON-NETS
    Pach, Janos
    Tardos, Gabor
    [J]. JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 2013, 26 (03) : 645 - 658
  • [34] Tight Lower Bounds for Selection in Randomly Ordered Streams
    Chakrabarti, Amit
    Jayram, T. S.
    Patrascu, Mihai
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 720 - +
  • [35] TIGHT LOWER BOUNDS TO EIGENVALUES OF THE SCHRODINGER-EQUATION
    HILL, RN
    [J]. JOURNAL OF MATHEMATICAL PHYSICS, 1980, 21 (08) : 2182 - 2192
  • [36] LOWER BOUNDS ON THE LENGTH OF MONOTONE PATHS IN ARRANGEMENTS
    MATOUSEK, J
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (02) : 129 - 134
  • [37] On Upper and Lower Bounds on the Length of Alternating Towers
    Holub, Stepan
    Jiraskova, Galina
    Masopust, Tomas
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 315 - +
  • [38] TIGHT BOUNDS ON THE PATH-LENGTH OF BINARY-TREES
    DESANTIS, A
    PERSIANO, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 478 - 487
  • [39] LOWER BOUNDS ON THE LENGTH OF UNIVERSAL TRAVERSAL SEQUENCES
    BORODIN, A
    RUZZO, WL
    TOMPA, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 45 (02) : 180 - 203
  • [40] Lower bounds on proof length in axiomatic theories
    Orevkov, V
    [J]. IN THE SCOPE OF LOGIC: METHODOLOGY & PHILOSOPHY OF SCIENCE, 2002, 315 : 17 - 26
12345