The Simplest Families of Polytopes Associated with NP-Hard Problems

被引：1
|
作者：
Maksimenko, A. N. [1 ]
机构：
[1] Yaroslavl State Univ, Yaroslavl 150000, Russia
来源：
DOKLADY MATHEMATICS | 2015年 / 91卷 / 01期
关键词：
Vertex Cover; Quadratic Linear; Extension Complexity; Simple Family; Yaroslavl State Univer Sity;
D O I：
10.1134/S1064562415010160
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：53 / 55
页数：3
相关论文
共 50 条
  • [41] SOME OBSERVATIONS ON THE PROBABILISTIC ALGORITHMS AND NP-HARD PROBLEMS
    KO, KI
    [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 39 - 43
  • [42] Matrix representation and gradient flows for NP-hard problems
    [J]. J Optim Theory Appl, 1 (197):
  • [43] Serious Games for NP-hard Problems: Challenges and Insights
    Chung, Christina
    Matsuoka, Asako
    Yang, Yueti
    Rubin, Julia
    Chechik, Marsha
    [J]. 2016 IEEE/ACM 5TH INTERNATIONAL WORKSHOP ON GAMES AND SOFTWARE ENGINEERING (GAS), 2016, : 29 - 32
  • [44] Stochastic Enumeration Method for Counting NP-Hard Problems
    Rubinstein, Reuven
    [J]. METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2013, 15 (02) : 249 - 291
  • [45] A Differential Approach for Several NP-hard Optimization Problems
    Jena, Sangram K.
    Subramani, K.
    Velasquez, Alvaro
    [J]. ARTIFICIAL INTELLIGENCE AND IMAGE ANALYSIS, ISAIM 2024, IWCIA 2024, 2024, 14494 : 68 - 80
  • [46] LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP
    Prusa, Daniel
    Werner, Tomas
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1372 - 1382
  • [47] GENERATING HARD AND DIVERSE TEST SETS FOR NP-HARD GRAPH PROBLEMS
    SANCHIS, LA
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 58 (01) : 35 - 66
  • [48] Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
    Bauer, D
    Broersma, HJ
    Morgana, A
    Schmeichel, E
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) : 13 - 23
  • [49] FINDING APPROXIMATE SOLUTIONS TO NP-HARD PROBLEMS BY NEURAL NETWORKS IS HARD
    YAO, X
    [J]. INFORMATION PROCESSING LETTERS, 1992, 41 (02) : 93 - 98
  • [50] A fuzzy system for multiobjective problems - A case study in NP-hard problems
    Gholamian, MR
    Ghomi, SMTF
    Ghazanfari, M
    [J]. ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS II, 2005, 187 : 1 - 13
12345