1 problem

0 votes0 replies1 view
Alon's conjecture on easy testability of semi-algebraic graph properties
A semi-algebraic graph property ${\cal P}$ is specified by an integer $k\geq 1$ , real polynomials $f_1,\dots,f_t\in\mathbb{R}[x_1,\dots,x_{2k}]$ , and a Boolean function…
Conjectureopengraph-theory property-testing semi-algebraic-graphsarXiv posted 2 days ago

Alon's conjecture on easy testability of semi-algebraic graph properties