Editing Open Problems:45
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 36: | Line 36: | ||
* Dichotomy theorem for sketching approximation of all Boolean Max-CSPs: For every Boolean Max-CSP, there is a constant $\alpha$ such that for every $\varepsilon$, (i) there is an $O(\log n)$ space $(\alpha-\varepsilon)$-approximation linear sketching algorithm and (ii) $\Omega(\sqrt{n})$ space is needed to obtain a better than $\alpha$ sketching approximation {{cite|ChouGSV-21}}. | * Dichotomy theorem for sketching approximation of all Boolean Max-CSPs: For every Boolean Max-CSP, there is a constant $\alpha$ such that for every $\varepsilon$, (i) there is an $O(\log n)$ space $(\alpha-\varepsilon)$-approximation linear sketching algorithm and (ii) $\Omega(\sqrt{n})$ space is needed to obtain a better than $\alpha$ sketching approximation {{cite|ChouGSV-21}}. | ||
* Dichotomy theorem for sketching approximation of all finite Max-CSPs: For every finite Max-CSP, there is a constant $\alpha$ such that for every $\varepsilon$, (i) there is an $O(\log n)$ space $(\alpha-\varepsilon)$-approximation linear sketching algorithm and (ii) $\Omega(\sqrt{n})$ space is needed to obtain a better than $\alpha$ sketching approximation {{cite|ChouGSV-21a}}. | * Dichotomy theorem for sketching approximation of all finite Max-CSPs: For every finite Max-CSP, there is a constant $\alpha$ such that for every $\varepsilon$, (i) there is an $O(\log n)$ space $(\alpha-\varepsilon)$-approximation linear sketching algorithm and (ii) $\Omega(\sqrt{n})$ space is needed to obtain a better than $\alpha$ sketching approximation {{cite|ChouGSV-21a}}. | ||
β | |||
β |