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 条
  • [1] The simplest families of polytopes associated with NP-hard problems
    A. N. Maksimenko
    [J]. Doklady Mathematics, 2015, 91 : 53 - 55
  • [2] DECOMPOSITION OF ARITHMETICAL NP-HARD PROBLEMS
    MEJZLIK, P
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 48 (1-2) : 31 - 38
  • [3] Most Tensor Problems Are NP-Hard
    Hillar, Christopher J.
    Lim, Lek-Heng
    [J]. JOURNAL OF THE ACM, 2013, 60 (06)
  • [4] POLYNOMIAL BOUNDING FOR NP-HARD PROBLEMS
    CAMERINI, PM
    MAFFIOLI, F
    [J]. MATHEMATICAL PROGRAMMING STUDY, 1980, 12 (APR): : 115 - 119
  • [5] Dynamic Programming for NP-Hard Problems
    Wang, Xiaodong
    Tian, Jun
    [J]. CEIS 2011, 2011, 15
  • [6] The Fault Tolerance of NP-Hard Problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 374 - +
  • [7] The fault tolerance of NP-hard problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    [J]. INFORMATION AND COMPUTATION, 2011, 209 (03) : 443 - 455
  • [8] NP-HARD MODULE ROTATION PROBLEMS
    AHN, K
    SAHNI, S
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (12) : 1506 - 1510
  • [9] Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT
    Golovnev, Alexander
    Kulikov, Alexander S.
    Mihajlin, Ivan
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (03)
  • [10] On the solution of NP-hard linear complementarity problems
    Joaquim J. Júdice
    Ana M. Faustino
    Isabel Martins Ribeiro
    [J]. Top, 2002, 10 (1) : 125 - 145
12345