后嵌入问题的参数序递归复杂性
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
摘要：
后嵌入问题（Post Embedding Problems）是一类基于有理关系与子字嵌入序的相互作用的决策问题，在文献中被用来证明非乘递归复杂度的下界。我们改进了Chambart和Schnoebelen（LICS 2008）的构造，并证明了参数下界取决于字母表的大小。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
