1 code implementation • 11 Sep 2023 • Qingxiu Dong, Li Dong, Ke Xu, Guangyan Zhou, Yaru Hao, Zhifang Sui, Furu Wei
In this work, we use large language models (LLMs) to augment and accelerate research on the P versus NP problem, one of the most important open problems in theoretical computer science and mathematics.
no code implementations • 19 Feb 2023 • Ke Xu, Guangyan Zhou
In this paper, by constructing extremely hard examples of CSP (with large domains) and SAT (with long clauses), we prove that such examples cannot be solved without exhaustive search, which is stronger than P $\neq$ NP.
no code implementations • 9 May 2021 • Guangyan Zhou, Wei Xu
The concept of super solution is a special type of generalized solutions with certain degree of robustness and stability.
no code implementations • 11 Mar 2021 • Guangyan Zhou
Moreover, the distribution of forced RB instances in the corresponding forced instance space is asymptotically the same with that of unforced RB instances in the unforced instance space.
Computational Complexity Combinatorics 60C05, 68Q87, 68T20
no code implementations • 5 Nov 2020 • Jun Liu, Ke Xu, Guangyan Zhou
The second moment method has always been an effective tool to lower bound the satisfiability threshold of many random constraint satisfaction problems.