Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
Saved in:
| Published in | Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3519935.3519955 |
Cover
| DOI: | 10.1145/3519935.3519955 |
|---|