David Witmer
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| How to refute a random CSP | 2025-08-05 | Paper |
| Lower bounds for CSP refutation by SDP hierarchies (available as arXiv preprint) | 2018-04-19 | Paper |
| Sum of squares lower bounds for refuting any CSP Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Sparsest cut on bounded treewidth graphs: algorithms and hardness results Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Research outcomes over time
This page was built for person: David Witmer
