OPG-36884
Open
L2
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Category:Computer Science
Set:OpenGarden
Problem Statement
Background
About Computer Science: Computational complexity, algorithms, and theoretical CS.
Discussion (0)
No comments yet. Be the first to discuss this problem!
Sign in to start the conversation.
Checking sign-in status...