Search Results for author:
Found 5 papers, 1 papers with code
Large Language Model for Science: A Study on P vs. NP
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.
SAT Requires Exhaustive Search
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.
Super Solutions of the Model RB
The concept of super solution is a special type of generalized solutions with certain degree of robustness and stability.
Hiding solutions in model RB: Forced instances are almost as hard as unforced ones
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
Exact Phase Transitions of Model RB with Slower-Growing Domains
The second moment method has always been an effective tool to lower bound the satisfiability threshold of many random constraint satisfaction problems.
