增量FPT时间中的枚举
Enumeration in Incremental FPT-Time
摘要:
在本文中,我们研究了Creamusu等人(MFCS 2013)定义的参数化枚举复杂性类之间的关系。具体来说,我们引入两个层次结构(IncFPTA和CapIncFPTA)的枚举复杂性类的增量FPT时间的指数切片,并显示他们如何交错。此外,我们定义了几个参数化函数类,特别是,引入参数化对应的非确定性多值函数类的值是多项式可验证的,并保证存在,TFNP,已知Megiddo和Papadimitriou(TCS 1991)。我们证明了TF(para-NP)坍缩到F(FPT)等价于OutputFPT与IncFPT重合。这一结果反过来又与经典函数设置中的崩溃有关,并最终与IncP和OutputP的崩溃有关,这证明了经典枚举与参数化枚举的第一个直接联系。
英文摘要:
In this paper, we study the relationship of parametrised enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt-time in terms of exponent slices and show how they interleave. Furthermore, we define several parametrised function classes and, in particular, introduce the parametrised counterpart of the class of nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist, TFNP, known from Megiddo and Papadimitriou (TCS 1991). We show that TF(para-NP) collapsing to F(FPT) is equivalent to OutputFPT coinciding with IncFPT. This result is in turn connected to a collapse in the classical function setting and eventually to the collapse of IncP and OutputP which proves the first direct connection of classical to parametrised enumeration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。