author-photo

Jonah Brown-Cohen

Royal Institute of Technology

5

Papers

0

Citations

Citation Trend

Filter By

Papers (3) Sort By

Journal Conference Others

Optimal inapproximability with universal factor graphs

2021 SODA | Symposium on Discrete Algorithms
Show All
- Source
- Cite
- Save
Citations (0)
Extended formulation lower bounds for refuting random CSPs

2020 SODA | Symposium on Discrete Algorithms
- Jonah Brown-Cohen
- Prasad Raghavendra
Show All
- Source
- Cite
- Save
Citations (0)
The matching problem has no small symmetric SDP

2016 SODA | Symposium on Discrete Algorithms
Show All
- Source
- Cite
- Save
Citations (0)