NP交叉口coNP中的两点问题
The Two Bicliques Problem is in NP intersection coNP
摘要：
证明了判定一个图的顶点集是否能被至多两个二分点覆盖的问题是NP $\cap$ coNP问题。因此，我们几乎确定了一个问题的计算复杂性，这个问题的状态已经开放了相当长的一段时间。我们的结果意味着，一个多项式时间算法的问题是更有可能比它是NP-完全的，除非P = NP。
英文摘要：
We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite some time. Our result implies that a polynomial time algorithm for the problem is more likely than it being NP-complete unless P = NP.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
