ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Proof of the Satisfiability Conjecture for Large k
Article URLs:
Alternative Article URLs:
Authors: Jian Ding
  • University of Chicago, Department of Statistics
Allan Sly
  • Univ. of California–Berkeley Berkeley, California, Department of Statistics
Nike Sun
  • Microsoft Research
  • MIT, Cambridge, Massachusetts, Dept. of Mathematics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1313596, 1208338, 1352013, 1401123
DBLP Key: conf/stoc/DingSS15
Author Comments:

Discuss this paper and its artifacts below