COMPLEXITY OF SOME COMBINATORIAL CONSTRUCTIONS

被引:0
|
作者
CARSTENS, HG
机构
关键词
D O I
10.1002/malq.19770230705
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:121 / 130
页数:10
相关论文
共 50 条
  • [21] Combinatorial constructions of repairable ramp schemes
    Zhao, Jinghui
    Shan, Xiuling
    Tian, Zihong
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2024, 16 (04): : 699 - 719
  • [22] Combinatorial constructions of packings in Grassmannian spaces
    Tao Zhang
    Gennian Ge
    Designs, Codes and Cryptography, 2018, 86 : 803 - 815
  • [23] Combinatorial constructions of packings in Grassmannian spaces
    Zhang, Tao
    Ge, Gennian
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (04) : 803 - 815
  • [24] Finite field constructions of combinatorial arrays
    Moura, Lucia
    Mullen, Gary L.
    Panario, Daniel
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 78 (01) : 197 - 219
  • [25] Combinatorial constructions for optimal supersaturated designs
    Fang, KT
    Ge, GN
    Liu, MQ
    Qin, H
    DISCRETE MATHEMATICS, 2004, 279 (1-3) : 191 - 202
  • [26] Combinatorial designs and related computational constructions
    Adams, P
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1996, 53 (03) : 521 - 523
  • [27] Finite field constructions of combinatorial arrays
    Lucia Moura
    Gary L. Mullen
    Daniel Panario
    Designs, Codes and Cryptography, 2016, 78 : 197 - 219
  • [28] A COMBINATORIAL APPROACH TO COMPLEXITY
    PUDLAK, P
    RODL, V
    COMBINATORICA, 1992, 12 (02) : 221 - 226
  • [29] The combinatorial complexity of masterkeying
    Espelage, W
    Wanke, E
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2000, 52 (02) : 325 - 348
  • [30] The combinatorial complexity of masterkeying
    Wolfgang Espelage
    Egon Wanke
    Mathematical Methods of Operations Research, 2000, 52 : 325 - 348