COMPLEXITY OF SOME COMBINATORIAL CONSTRUCTIONS

被引:0
|
作者
CARSTENS, HG
机构
关键词
D O I
10.1002/malq.19770230705
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:121 / 130
页数:10
相关论文
共 50 条
  • [41] Complexity of Combinatorial Market Makers
    Chen, Yiling
    Fortnow, Lance
    Lambert, Nicolas
    Pennock, David M.
    Wortman, Jennifer
    EC'08: PROCEEDINGS OF THE 2008 ACM CONFERENCE ON ELECTRONIC COMMERCE, 2008, : 190 - 199
  • [42] Combinatorial complexity of convex sequences
    Iosevich, A
    Konyagin, S
    Rudnev, M
    Ten, V
    DISCRETE & COMPUTATIONAL GEOMETRY, 2006, 35 (01) : 143 - 158
  • [43] COMBINATORIAL COMPLEXITY OF SIGNED DISCS
    SOUVAINE, DL
    YAP, CK
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1995, 5 (04): : 207 - 223
  • [44] Combinatorial interpretation of Kolmogorov complexity
    Romashchenko, A
    Shen, A
    Vereshchagin, N
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 131 - 137
  • [45] THE COMBINATORIAL COMPLEXITY OF POLYGON OVERLAY
    SAALFELD, A
    AUTO CARTO 9 : NINTH INTERNATIONAL SYMPOSIUM ON COMPUTER-ASSISTED CARTOGRAPHY, 1989, : 278 - 287
  • [46] On the Combinatorial Complexity of Approximating Polytopes
    Arya, Sunil
    da Fonseca, Guilherme D.
    Mount, David M.
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 58 (04) : 849 - 870
  • [47] Kolmogorov Complexity as a Combinatorial Tool
    Shen, Alexander
    TWENTY YEARS OF THEORETICAL AND PRACTICAL SYNERGIES, CIE 2024, 2024, 14773 : 27 - 31
  • [48] Combinatorial interpretation of Kolmogorov complexity
    Romashchenko, A
    Shen, A
    Vereshchagin, N
    THEORETICAL COMPUTER SCIENCE, 2002, 271 (1-2) : 111 - 123
  • [49] On the Combinatorial Complexity of Approximating Polytopes
    Sunil Arya
    Guilherme D. da Fonseca
    David M. Mount
    Discrete & Computational Geometry, 2017, 58 : 849 - 870
  • [50] Combinatorial Complexity of Convex Sequences
    Alex Iosevich
    S. Konyagin
    M. Rudnev
    V. Ten
    Discrete & Computational Geometry, 2006, 35 : 143 - 158