skip to main content


Title: Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
Award ID(s):
2211972
NSF-PAR ID:
10423407
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing
Page Range / eLocation ID:
678 to 689
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found