arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.05472cs.CC
收藏

求解NP-intermediate中图灵核下界问题和寻找自然候选问题的框架

Frameworks for Solving Turing Kernel Lower Bound Problem and Finding Natural Candidate Problems in NP-intermediate

Weidong Luo

摘要:

核化是参数化复杂性研究中的一个重要课题。图灵核化是核化的一般形式。在核化方面,已经建立了令人印象深刻的硬度理论[Bodlaender等(ICALP 2008,JCSS 2009),Fortnow和Santhanam(STOC 2008,JCSS 2011),Dell和van Melkebeek(STOC 2010,J. ACM 2014),Drucker(FOCS 2012,SIAM J. Comput. 2015)],其可以获得内核大小的下界。不幸的是,还没有工具可以证明图灵内核下界的任何FPT问题模任何合理的复杂性假设。因此,构建图灵核下界的框架在不同场合被提出作为开放问题[Fernau等(STACS 2009),Misra等(离散优化2011),Kratsch(EATCS公告2014),Cygan等(Dagstuhl内核研讨会2014)]。Ladner [J. ACM 1975]证明了如果$P \not = NP$,则存在无穷多个NP-中间问题。然而,Ladner构造的NP-中间问题是人为的。因此,在$P \not= NP$假设下寻找自然NP-中间问题是计算复杂性领域的一个长期未决问题。本文在参数化复杂性和经典计算复杂性之间架起了一座新的桥梁。通过使用这种新的连接,可以构建一些框架。基于多项式层次和指数层次不会崩溃的假设,这些框架有三个主要应用。首先,这些框架可以用来获得一些重要的FPT问题的图灵核下界,从而解决第一个公开问题。其次,这些框架也可以用来获得更好的核下界这些问题。第三,这些框架可以用来解决大量的NP-中间的自然问题,从而对第二个开放问题做出了一定的贡献。

英文摘要:

Kernelization is a significant topic in parameterized complexity. Turing kernelization is a general form of kernelization. In the aspect of kernelization, an impressive hardness theory has been established [Bodlaender etc. (ICALP 2008, JCSS2009), Fortnow and Santhanam (STOC 2008, JCSS 2011), Dell and van Melkebeek (STOC 2010, J. ACM 2014), Drucker (FOCS 2012, SIAM J. Comput. 2015)], which can obtain lower bounds of kernel size. Unfortunately, there is yet no tool can prove Turing kernel lower bound for any FPT problem modulo any reasonable complexity hypothesis. Thus, constructing a framework for Turing kernel lower bound was proposed as an open problem in different occasions [Fernau etc. (STACS 2009), Misra etc. (Discrete Optimization 2011), Kratsch (Bulletin of the EATCS 2014), Cygan etc. (Dagstuhl Seminars on kernels 2014)]. Ladner [J. ACM 1975] proved that if $P \not = NP$, then there exist infinitely many NP-intermediate problems. However, the NP-intermediate problem constructed by Ladner is artificial. Thus, finding natural NP-intermediate problems under the assumption of $P \not= NP$ is a longstanding open problem in computation complexity community. This paper builds a new bridge between parameterized complexity and classic computational complexity. By using this new connection, some frameworks can be constructed. Based on the assumption that the polynomial hierarchy and the exponential hierarchy will not collapse, these frameworks have three main applications. Firstly, these frameworks can be used to obtain Turing kernel lower bounds of some important FPT problems, thus solving the first open problem. Secondly, these frameworks can also be used to obtain better kernel lower bounds for these problems. Thirdly, these frameworks can be used to figure out a large number of natural problems in NP-intermediate, thus making some contributions to the second open problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑