The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

被引：0
|
作者：
Karandikar, Prateek [1 ,2 ,3 ]
Schmitz, Sylvain [2 ,3 ]
机构：
[1] CMI, Madras, Tamil Nadu, India
[2] ENS Cachan, LSV, Cachan, France
[3] CNRS, Cachan, France
来源：
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2013) | 2013年 / 7794卷
关键词：
UNRELIABLE CHANNELS; SYSTEMS; PROGRAMS; LOSSY;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.
引用
收藏
页码：273 / 288
页数：16
相关论文
共 32 条
  • [1] The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
    Haddad, Serge
    Schmitz, Sylvain
    Schnoebelen, Philippe
    [J]. 2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 355 - 364
  • [2] ORDINAL COMPLEXITY OF RECURSIVE DEFINITIONS
    FAIRTLOUGH, MVH
    WAINER, SS
    [J]. INFORMATION AND COMPUTATION, 1992, 99 (02) : 123 - 153
  • [3] Ordinal recursive complexity of lossy channel systems
    Chambart, P.
    Schnoebelen, Ph.
    [J]. TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 205 - +
  • [4] Ordinal recursive complexity of Unordered Data Nets
    Rosa-Velardo, Fernando
    [J]. INFORMATION AND COMPUTATION, 2017, 254 : 41 - 58
  • [5] ON THE COMPLEXITY OF TREE EMBEDDING PROBLEMS
    SIMONSON, S
    SUDBOROUGH, IH
    [J]. INFORMATION PROCESSING LETTERS, 1992, 44 (06) : 323 - 328
  • [6] PARAMETRIC AND ORDINAL CRITERIA IN SITUATION RECOGNITION PROBLEMS
    VOLGIN, LN
    [J]. AUTOMATION AND REMOTE CONTROL, 1967, (09) : 1332 - &
  • [7] The complexity of recursive constraint satisfaction problems
    Marek, Victor W.
    Remmel, Jeffrey B.
    [J]. ANNALS OF PURE AND APPLIED LOGIC, 2009, 161 (03) : 447 - 457
  • [8] Parametric embedding of nonparametric inference problems
    Alvo M.
    Lai T.L.
    Yu P.L.H.
    [J]. Journal of Statistical Theory and Practice, 2018, 12 (1) : 151 - 164
  • [9] THE PARALLEL COMPLEXITY OF TREE EMBEDDING PROBLEMS
    GUPTA, A
    NISHIMURA, N
    [J]. JOURNAL OF ALGORITHMS, 1995, 18 (01) : 176 - 200
  • [10] THE PARALLEL COMPLEXITY OF TREE EMBEDDING PROBLEMS
    GUPTA, A
    NISHIMURA, N
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 21 - 32
1234