THE CRITICAL COMPLEXITY OF GRAPH PROPERTIES

被引：29
|
作者：
TURAN, G
机构：
来源：
INFORMATION PROCESSING LETTERS | 1984年 / 18卷 / 03期
关键词：
D O I：
10.1016/0020-0190(84)90019-X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：151 / 153
页数：3
相关论文
共 50 条
  • [1] THE CRITICAL COMPLEXITY OF ALL (MONOTONE) BOOLEAN FUNCTIONS AND MONOTONE GRAPH PROPERTIES
    WEGENER, I
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 494 - 502
  • [2] THE CRITICAL COMPLEXITY OF ALL (MONOTONE) BOOLEAN FUNCTIONS AND MONOTONE GRAPH PROPERTIES
    WEGENER, I
    INFORMATION AND CONTROL, 1985, 67 (1-3): : 212 - 222
  • [3] DECISION TREE COMPLEXITY OF GRAPH PROPERTIES
    Gao Suixiang (Mathematics Department
    中国科学院研究生院学报, 1999, (02) : 95 - 99
  • [4] On the recognition complexity of some graph properties
    Triesch, E
    COMBINATORICA, 1996, 16 (02) : 259 - 268
  • [5] On the sensitivity complexity of bipartite graph properties
    Gao, Yihan
    Mao, Jieming
    Sun, Xiaoming
    Zuo, Song
    THEORETICAL COMPUTER SCIENCE, 2013, 468 : 83 - 91
  • [6] AN ASYMPTOTIC BOUND FOR THE COMPLEXITY OF MONOTONE GRAPH PROPERTIES
    Korneffel, Torsten
    Triesch, Eberhard
    COMBINATORICA, 2010, 30 (06) : 735 - 743
  • [7] GRAPH-THEORETIC PROPERTIES IN COMPUTATIONAL COMPLEXITY
    VALIANT, LG
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 278 - 285
  • [8] An asymptotic bound for the complexity of monotone graph properties
    Torsten Korneffel
    Eberhard Triesch
    Combinatorica, 2010, 30 : 735 - 743
  • [9] A LOWER BOUND FOR THE COMPLEXITY OF MONOTONE GRAPH PROPERTIES
    Scheidweiler, Robert
    Triesch, Eberhard
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 257 - 265
  • [10] Complexity Properties of Critical Sets of Arguments
    Booth, Richard
    Caminada, Martin
    Dunne, Paul E.
    Podlaszewski, Mikolaj
    Rahwan, Iyad
    COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 173 - 184
12345