2 problems

0 votes0 replies0 views
Submodular separation conjecture for low-degree monomial families
Submodular separation conjecture. For every such $r,d$ , there exists a submodular function $f$ such that $f(x)$ is computable in $\mathrm{poly}(n)$ time, $f(x)\leqslant-1$ for ever…
Conjectureopencombinatorial-optimization modular-constraints submodular-optimizationarXiv posted 2 days ago
0 votes0 replies0 views
Covering-number conjecture for polynomial representations of NAND modulo a fixed integer
Covering-number conjecture. The covering number of every such polynomial is $d^{o_M(1)}$ . This would bound the complexity of the obstructions underlying the paper's constant-round…
Conjectureopencomplexity-theory modular-constraints polynomial-representationsarXiv posted 2 days ago

Submodular separation conjecture for low-degree monomial families