THE COMPLEXITY OF COMBINATORIAL PROBLEMS WITH SUCCINCT INPUT REPRESENTATION

被引：188
|
作者：
WAGNER, KW
机构：
来源：
ACTA INFORMATICA | 1986年 / 23卷 / 03期
关键词：
D O I：
10.1007/BF00289117
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：325 / 356
页数：32
相关论文
共 50 条
  • [1] The complexity of semilinear problems in succinct representation
    Buergisser, Peter
    Cucker, Felipe
    de Naurois, Paulin Jacobe
    COMPUTATIONAL COMPLEXITY, 2006, 15 (03) : 197 - 235
  • [2] The complexity of semilinear problems in succinct representation
    Peter Bürgisser
    Felipe Cucker
    Paulin Jacobé de Naurois
    computational complexity, 2006, 15 : 197 - 235
  • [3] The complexity of semilinear problems in succinct representation
    Bürgisser, P
    Cucker, F
    de Naurois, PJ
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 479 - 490
  • [4] COMPLEXITY OF APPROXIMATE SOLUTION OF COMBINATORIAL PROBLEMS
    NIGMATULLIN, RG
    DOKLADY AKADEMII NAUK SSSR, 1975, 224 (02): : 289 - 292
  • [5] On the computational complexity of combinatorial flexibility problems
    Leoni, V. A.
    Nasini, G. L.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (15) : 3330 - 3343
  • [6] The Complexity of Succinct Elections
    Fitzsimmons, Zack
    Hemaspaandra, Edith
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4921 - 4922
  • [7] ON THE SUCCINCT REPRESENTATION OF GRAPHS
    TURAN, G
    DISCRETE APPLIED MATHEMATICS, 1984, 8 (03) : 289 - 294
  • [8] Complexity among combinatorial problems from epidemics
    Piccini, Juan
    Robledo, Franco
    Romero, Pablo
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (01) : 295 - 318
  • [9] On the complexity of a class of combinatorial optimization problems with uncertainty
    Averbakh, I
    MATHEMATICAL PROGRAMMING, 2001, 90 (02) : 263 - 272
  • [10] On the complexity of a class of combinatorial optimization problems with uncertainty
    Igor Averbakh
    Mathematical Programming, 2001, 90 : 263 - 272
12345